Burali-Forti paradox

The Burali-Forti paradox demonstrates that the class of all ordinals is not a set. If there were a set of all ordinals, $O r d$ , then it would follow that $O r d$ was itself an ordinal, and therefore that $Ord\\in Ord$ . if sets in general are allowed to contain themselves, ordinals cannot since they are defined so that $\\in$ is well founded over them.

This paradox is similar to both Russell’s paradox and Cantor’s paradox, although it predates both. All of these paradoxes prove that a certain object is “too large” to be a set.

单词	BuraliFortiParadox
释义	Burali-Forti paradox The Burali-Forti paradox demonstrates that the class of all ordinals is not a set. If there were a set of all ordinals, $O r d$ , then it would follow that $O r d$ was itself an ordinal, and therefore that $Ord\\in Ord$ . if sets in general are allowed to contain themselves, ordinals cannot since they are defined so that $\\in$ is well founded over them. This paradox is similar to both Russell’s paradox and Cantor’s paradox, although it predates both. All of these paradoxes prove that a certain object is “too large” to be a set.
随便看	Hausdorff paradox HausdorffPropertyIsHereditary Hausdorff property is hereditary HausdorffsMaximumPrinciple HausdorffSpace Hausdorff space HausdorffSpaceNotCompletelyHausdorff Hausdorff space not completely Hausdorff Hausdorff’s maximum principle HayashisConnectingLemma Hayashi’s connecting lemma HazardFunction hazard function Hcobordism h-cobordism Heap heap heap Heap1 HeapInsertionAlgorithm heap insertion algorithm HeapRemovalAlgorithm heap removal algorithm HeapsLaw Heapsort