well-ordered

A set with a total ordering defined on its elements is said to be well-ordered if every non-empty subset contains a least element under the relation.

For example, the set of natural numbers is well-ordered by the less-than (<) relation, but the set of integers is not well-ordered by < because it has no least element.

Home