basic constructions:
strong axioms
further
Neumann–Bernays–Gödel set theory (NBG) is a material set theory: a conservative extension of ZFC whose ontology includes proper classes, like MK. But unlike ZFC and MK, NBG can be finitely axiomatized.
Georg Cantor was well acquainted with the phenomenon that some collections are ‘too big’ to be sets. In his late years he made a distinction between consistent and inconsistent multitudes, the former comprising sets, but his ideas were confined to private letters to (Jourdain and) Dedekind that were not published until 1932.
John von Neumann began work on NBG in the 1920s (von Neumann 1925, von Neumann 1928), but his version was unwieldy. Paul Bernays and Kurt Gödel simplified it later, also illustrating Gödel’s theorem that any first-order theory has a conservative extension with a finite axiomatization.
NBG is a material set theory, based on a global binary membership predicate $\in$. The objects of NBG are called classes. If a class $x$ is a member of another class $A$, i.e., $x \in A$, then $x$ is called set. A class which is not a set is called proper class. NBG can be presented as a two-sorted theory, with lowercase letters denoting sets and uppercase letters denoting classes.
Extensionality: Two classes are equal if and only if the have the same members.
Pairing, Union, Power Sets and Infinity: regard sets and are identical to the ZFC counterparts.
Foundation: For each nonempty class $A$ there exists a set $x \in A$ such that $x \cap A = \varnothing$.
Class Comprehension schema: For any formula $\phi$ containing no quantifiers over classes (it may contain quantifiers over sets and it may contain both class and set parameters), there is a class $A$ whose elements are precisely those sets $x$ satisfying $\phi(x)$. In particular, taking $\phi(x)$ as $x = x$ it follows that there exists the class $V$ of all sets.
Limitation of Size: A class $A$ is a set if and only if there is no bijection between $A$ and the class $V$ of all sets.
From the axiom of Limitation of Size, it turn out that $V$ is not a set but a proper class, avoiding Russell's paradox. Moreover, since one can prove that the ordinal numbers form a proper class, there is a bijection beetween $V$ and $\mathrm{Ord}$, i.e., the class of all sets can be well-ordered which implies the axiom of global choice.
Every instance of class comprehension can be built out of a few, based on the logical connnectives. This is similar to the finite axiomatization of bounded $ZFC$ (or, in other language, ETCS); indeed, $NBG$ is essentially bounded MK.
An expository account:
Last revised on June 6, 2024 at 07:29:45. See the history of this page for a list of all contributions to it.