The Fundamental Theorem of Galois Theory
Part of the Universitext book series (UTX)
A lattice is a partially ordered set (L, ≤) in which each pair of elements a, b of L has a least upper bound a ∨ b and a greatest lower bound a ∧ b.
KeywordsNormal Subgroup Binary Relation Galois Group Fundamental Theorem Field Extension
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag New York Inc. 1990