well-ordering principle
The well-ordering principle states that every non-empty subset of the nonnegative integers contains a least element.
Formally, the natural numbers are a well-order, i.e. a total order with least element in every subset.
Select a result to preview
The well-ordering principle states that every non-empty subset of the nonnegative integers contains a least element.
Formally, the natural numbers are a well-order, i.e. a total order with least element in every subset.