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...") |
|||
| Line 2: | Line 2: | ||
The Well-Ordering theorem is equivalent to the [[Axiom of choice]] and [[Zorn's Lemma]]. | The Well-Ordering theorem is equivalent to the [[Axiom of choice]] and [[Zorn's Lemma]]. | ||
| + | |||
| + | {{stub}} | ||
| + | |||
| + | [[Category:Set theory]] | ||
Latest revision as of 12:40, 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.
This article is a stub. Help us out by expanding it.
