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.

 

<< PreviousWord BrowserNext >>
irv novick
quill lake, saskatchewan
malaysian sign language
vowlan
albert e. bowen
safety life cycle
kod tangan bahasa malaysia
alonzo a. hinckley
velocity of propagation
frito bandito
muriel newman
anthony w. ivins
george teasdale
rs 68 (rocket engine)
black throated accentor
val anthony
mille feuille
heather roy
rank (mathematics)
uss blackfish (ss 221)
myriophyllum
jnco
freddie scott
travel medicine
calculus of negligence
the columbus citizen journal
minarets (california)
ken shirley
george a. smith
v.o. key, jr.
japanese mahjong scoring rule
abraham o. woodruff
charles william penrose
ian ewen street
orson f. whitney
morris the cat
benjamin hooks
australian court hierarchy
james e. talmage
stephen l. richards
california proposition 1a (2004)
richard r. lyman
australian legislative election, 2004: results
john a. widtsoe