Well-Ordering theorem

Revision as of 12:40, 2 June 2019 by Mrmxs (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 $(S,\prec)$ for which each set $A\subseteq S$ 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.