Well-ordering
From Maths
Revision as of 14:17, 12 March 2015 by Alec (Talk | contribs) (Created page with "A well-ordering is a special kind of ordering ==Definition== An ordering <math><</math> of a set {{M|P}} which is both: * Linear (total) * strict Is a ''well-or...")
A well-ordering is a special kind of ordering
Definition
An ordering [math]<[/math] of a set [ilmath]P[/ilmath] which is both:
- Linear (total)
- strict
Is a well-ordering if every [ilmath]A\subset P[/ilmath] with [ilmath]A\ne\emptyset[/ilmath] has a least element.
TODO: Finish off
