Difference between revisions of "Well-Ordering Theorem"
Jump to navigation
Jump to search
(New page: The '''Well-Ordering Theorem''' was proved by Zermelos in 1904, and it states: <blockquote> Every set can be well-ordered. </blockquote> This result surprised mathematicians everywhere. B...) |
(No difference)
|
Revision as of 10:32, April 2, 2007
The Well-Ordering Theorem was proved by Zermelos in 1904, and it states:
Every set can be well-ordered.
This result surprised mathematicians everywhere. Because the Well-Ordering Theorem is a direct consequence of the Axiom of Choice, and no well-ordering relation has ever been explicitly constructed for uncountable sets, therefore many mathematicians have rejected the Axiom of Choice.