Linked from

The 18 pages that link to Well-ordering theorem, each with the reason it gives.

• Partial orderRelated: It concerns a special kind of total order and highlights stronger ordering properties.

• Ordinal numberRelated: It connects ordinal order types to the possible orderings of arbitrary sets.

• Principia MathematicaRelated: Its foundational status highlights questions about which principles count as logic.

• Total orderRelated: A well-order is a total order with an additional least-element property.

• Zorn's lemmaRelated: It is equivalent to Zorn's lemma and the axiom of choice.

• Choice functionRelated: It is equivalent to the axiom guaranteeing choice functions for arbitrary nonempty families.

• Infinite setRelated: It guarantees an ordinal-based structure for every infinite set under standard set theory.

• Felix HausdorffRelated: Hausdorff’s work on ordered sets developed amid disputes over this foundational result.

• Goodstein's theoremRelated: Ordinals cannot descend forever, forcing the associated measures eventually to stop.

• Nonmeasurable setRelated: Well-ordering can produce nonmeasurable subsets of the real line, linking their existence to choice.

• Well-orderRelated: It extends well-ordering from familiar examples to arbitrary sets.

• Axiom of global choiceRelated: A global well-order can define a selector by choosing each set's least element.

• Teichmüller–Tukey lemmaRelated: It is another statement equivalent to the axiom of choice and helps locate the lemma among choice principles.