WellOrderingPrinciple
HomePage
|
RecentChanges
|
Preferences
The well ordering principle states the following:
Every non-empty set S of positive integers contains a least element; that is, there is some a in S such that a <= b for all elements b in S.
This is equivalent to the
AxiomOfChoice
.