Common
Well-ordering principle
Statement that all non empty subsets of positive numbers contains a least element
Well-ordering principle
In mathematics, the well-ordering principle states that every non-empty subset of nonnegative integers contains a least element. In other words, the set of nonnegative integers is well-ordered by its "natural" or "magnitude" order in which x {\displaystyle x} precedes y {\displaystyle y} if and only if y {\displaystyle y} is either x {\displaystyle x} or the sum of x {\displaystyle x} and some nonnegative integer (other orderings include the ordering 2 , 4 , 6 , . . . {\displaystyle 2,4,6,...} ; and 1 , 3 , 5 , . . . {\displaystyle 1,3,5,...} ). The phrase "well...
Open boosters, collect cards and trade them. Free to play.
Play for free