Well-ordering theorem
The well-ordering theorem states that every set can be well-ordered.
This is important because it makes every set susceptible to the powerful technique of transfinite induction.
The well-ordering principle is equivalent to the axiom of choice, in the sense that either one together with the Zermelo-Fraenkel axioms is sufficient to prove the other.
Referenced By
List of mathematical topics (V-Z)
|
