Well-ordering principle
Sometimes the phrase well-ordering principle is taken to be synonymous with "well-ordering theorem".
On other occasions the phrase is taken to mean the proposition that the set of integers contains a well-ordered subset, called the natural numbers, of which any nonempty subset always contains a least element.
Discussions
|
Discussion
Features
|
|
 |
Ask a
question about 'Well-ordering principle' |
|
|
 |
|
 |
Start a new
discussion about 'Well-ordering principle' |
|
|
|
|
 |
Answer
questions about 'Well-ordering principle' |
|
|
|
|
 |
'Well-ordering principle' discussion
forum |
|
|
Encyclopedia
Sometimes the phrase well-ordering principle is taken to be synonymous with "well-ordering theorem".
On other occasions the phrase is taken to mean the proposition that the set of integers contains a well-ordered subset, called the natural numbers, of which any nonempty subset always contains a least element.
