Well-ordering
From Maths
A well-ordering is a special kind of ordering
Definition
An ordering < of a set P which is both:
- Linear (total)
- strict
Is a well-ordering if every A⊂P with A≠∅ has a least element. (Then A is well-ordered[1])
TODO: Finish off
See also
References
- Jump up ↑ Topology - James R. Munkres - 2nd edition