Well-Ordering Theorem

From Conservapedia
This is the current revision of Well-Ordering Theorem as edited by EdBot (Talk | contribs) at 03:57, August 22, 2010. This URL is a permanent link to this version of this page.

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The Well-Ordering Theorem was proved by Zermelos in 1904, and it states:

Every set can be well-ordered.

This result surprised mathematicians everywhere. The Well-Ordering Theorem is equivalent of the Axiom of Choice, and no well-ordering relation has ever been explicitly constructed for uncountable sets. Thus, the mathematicians who reject the Axiom of Choice also reject this theorem.