# Difference between revisions of "Well-Ordering Theorem"

From Conservapedia

(Robot: Capitalize "Set theory" category) |
|||

Line 4: | Line 4: | ||

</blockquote> | </blockquote> | ||

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

− | [[Category: | + | |

+ | [[Category:Set Theory]] |

## Latest revision as of 03:57, 22 August 2010

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.