Every nonempty definable set of natural numbers has a least element. Over the usual arithmetic language, this principle is equivalent to the induction scheme.
The well-ordering principle quantifies over all nonempty subsets of the natural numbers; in first-order arithmetic this entry is its definable-set schema.
Articles by others on the same topic
There are currently no matching articles.