In set theory, the axiom of limitation of size was proposed by John von Neumann in his 1925 axiom system for sets and classes.[1] It formalizes the limitation of size principle, which avoids the paradoxes encountered in earlier formulations of set theory by recognizing that some classes are too big to be sets. Von Neumann realized that the paradoxes are caused by permitting these big classes to be members of a class.[2] A class that is a member of a class is a set; a class that is not a set is a proper class. Every class is a subclass of V, the class of all sets.[a] The axiom of limitation of size says that a class is a set if and only if it is smaller than V—that is, there is no function mapping it onto V. Usually, this axiom is stated in the equivalent form: A class is a proper class if and only if there is a function that maps it onto V.
Von Neumann's axiom implies the axioms of replacement, separation, union, and global choice. It is equivalent to the combination of replacement, union, and global choice in Von Neumann–Bernays–Gödel set theory (NBG) and Morse–Kelley set theory. Later expositions of class theories—such as those of Paul Bernays, Kurt Gödel, and John L. Kelley—use replacement, union, and a choice axiom equivalent to global choice rather than von Neumann's axiom.[3] In 1930, Ernst Zermelo defined models of set theory satisfying the axiom of limitation of size.[4]
Abraham Fraenkel and Azriel Lévy have stated that the axiom of limitation of size does not capture all of the "limitation of size doctrine" because it does not imply the power set axiom.[5] Michael Hallett has argued that the limitation of size doctrine does not justify the power set axiom and that "von Neumann's explicit assumption [of the smallness of power-sets] seems preferable to Zermelo's, Fraenkel's, and Lévy's obscurely hidden implicit assumption of the smallness of power-sets."[6]
^von Neumann 1925, p. 223; English translation: van Heijenoort 1967c, pp. 397–398.
^Hallett 1984, p. 290.
^Bernays 1937, pp. 66–70; Bernays 1941, pp. 1–6. Gödel 1940, pp. 3–7. Kelley 1955, pp. 251–273.
^Zermelo 1930; English translation: Ewald 1996.
^Fraenkel, Bar-Hillel & Levy 1973, p. 137.
^Hallett 1984, p. 295.
Cite error: There are <ref group=lower-alpha> tags or {{efn}} templates on this page, but the references will not show without a {{reflist|group=lower-alpha}} template or {{notelist}} template (see the help page).
and 23 Related for: Axiom of limitation of size information
the axiomoflimitationofsize was proposed by John von Neumann in his 1925 axiom system for sets and classes. It formalizes the limitationofsize principle...
classes. The axiomoflimitationofsize is an axiom in some versions of von Neumann–Bernays–Gödel set theory or Morse–Kelley set theory. This axiom says that...
the stronger axiomoflimitationofsize. Because it is impossible to quantify over definable functions in first-order logic, one instance of the schema...
Sciences, Springer Verlag, New York, 1982. Axiomof choice Axiomof infinity AxiomoflimitationofsizeAxiomof union Boltzmann brain Choice function Cumulative...
In mathematics, the axiomof regularity (also known as the axiomof foundation) is an axiomof Zermelo–Fraenkel set theory that states that every non-empty...
universe into [X] by mapping a set m to {m} × X, and so by the axiomoflimitationofsize, [X] is a proper class. The definition does work however in type...
In mathematics, the axiomof determinacy (abbreviated as AD) is a possible axiom for set theory introduced by Jan Mycielski and Hugo Steinhaus in 1962...
of mathematics and philosophy that use it, the axiomof infinity is one of the axiomsof Zermelo–Fraenkel set theory. It guarantees the existence of at...
versions of axiomatic set theory, the axiom schema of specification, also known as the axiom schema of separation, subset axiom scheme or axiom schema of restricted...
The axiomof countable choice or axiomof denumerable choice, denoted ACω, is an axiomof set theory that states that every countable collection of non-empty...
the axiomof power set is one of the Zermelo–Fraenkel axiomsof axiomatic set theory. It guarantees for every set x {\displaystyle x} the existence of a...
theory and the branches of logic, mathematics, and computer science that use it, the axiomof pairing is one of the axiomsof Zermelo–Fraenkel set theory...
foundational system for the whole of mathematics, particularly in the form of Zermelo–Fraenkel set theory with the axiomof choice. Besides its foundational...
In mathematics, the axiomof dependent choice, denoted by D C {\displaystyle {\mathsf {DC}}} , is a weak form of the axiomof choice ( A C {\displaystyle...
theory, the axiomof union is one of the axiomsof Zermelo–Fraenkel set theory. This axiom was introduced by Ernst Zermelo. Informally, the axiom states that...
theorem). The axiomof choice is equivalent to the statement that |A| ≤ |B| or |B| ≤ |A| for every A, B. In the above section, "cardinality" of a set was...
an axiom schema (plural: axiom schemata or axiom schemas) generalizes the notion ofaxiom. An axiom schema is a formula in the metalanguage of an axiomatic...
basic axiomsof type theory, three further axioms that seemed to not be true as mere matters of logic, namely the axiomof infinity, the axiomof choice...
cardinality of the real numbers." In Zermelo–Fraenkel set theory with the axiomof choice (ZFC), this is equivalent to the following equation in aleph numbers:...
Global Information