Difference between revisions of "Well-Ordering theorem"
(Created page with "The '''Well-Ordering theorem''' is an axiom for Set theory. It states that every set can be well-ordered. A well-ordered set is a totally ordered set <math>(S,\pre...") |
(No difference)
|
Revision as of 12:39, 2 June 2019
The Well-Ordering theorem is an axiom for Set theory. It states that every set can be well-ordered. A well-ordered set is a totally ordered set for which each set has a minimum element.
The Well-Ordering theorem is equivalent to the Axiom of choice and Zorn's Lemma.