Ordinal numbers in the context of Ranking system

In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, nth, etc.) aimed to extend enumeration to infinite sets.

A finite set can be enumerated by successively labeling each element with the least natural number that has not been previously used. To extend this process to various infinite sets, ordinal numbers are defined more generally using linearly ordered Greek letter variables that include the natural numbers and have the property that every set of ordinals has a least or "smallest" element (this is needed for giving a meaning to "the least unused element"). This more general definition allows us to define an ordinal number ${\displaystyle \omega }$ (omega) to be the least element that is greater than every natural number, along with ordinal numbers ⁠${\displaystyle \omega +1}$⁠, ⁠${\displaystyle \omega +2}$⁠, etc., which are even greater than ⁠${\displaystyle \omega }$⁠.