Rank (set theory)
Encyclopedia : R : RA : RAN : Rank (set theory)
In mathematical set theory, the rank of a set is defined inductively as the smallest ordinal number greater than the rank of any member of the set, where the rank of the empty set is zero. As a consequence, when using the normal set-theoretic definition of the ordinal numbers in terms of sets, every ordinal has a rank equal to itself.
See also
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.