HomePage | RecentChanges | Preferences

No diff available--this is the first major revision. (no other diffs)
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.

HomePage | RecentChanges | Preferences
This page is read-only | View other revisions
Last edited February 12, 2001 9:43 pm by RaviDesai (diff)