Rank (set theory)
From Wikipedia, the free encyclopedia
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.
[edit] See also
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
