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.
This article is licensed under the GNU Free Documentation License.
It uses material from the
"Rank (set theory)".
Home Page • arts • business • computers • games • health • hospitals • home • kids & teens • news • physicians • recreation• reference • regional • science • shopping • society • sports • world