Well-Ordering Theorem
From Conservapedia
This is an old revision of this page, as edited by AlanS (Talk | contribs) at 20:35, December 2, 2008. It may differ significantly from current revision.
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.
