Von Neumann–Bernays–Gödel set theory

Short description: System of mathematical set theory

In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of Zermelo–Fraenkel–choice set theory (ZFC). NBG introduces the notion of class, which is a collection of sets defined by a formula whose quantifiers range only over sets. NBG can define classes that are larger than sets, such as the class of all sets and the class of all ordinals. Morse–Kelley set theory (MK) allows classes to be defined by formulas whose quantifiers range over classes. NBG is finitely axiomatizable, while ZFC and MK are not.

A key theorem of NBG is the class existence theorem, which states that for every formula whose quantifiers range only over sets, there is a class consisting of the sets satisfying the formula. This class is built by mirroring the step-by-step construction of the formula with classes. Since all set-theoretic formulas are constructed from two kinds of atomic formulas (membership and equality) and finitely many logical symbols, only finitely many axioms are needed to build the classes satisfying them. This is why NBG is finitely axiomatizable. Classes are also used for other constructions, for handling the set-theoretic paradoxes, and for stating the axiom of global choice, which is stronger than ZFC's axiom of choice.

John von Neumann introduced classes into set theory in 1925. The primitive notions of his theory were function and argument. Using these notions, he defined class and set.[1] Paul Bernays reformulated von Neumann's theory by taking class and set as primitive notions.[2] Kurt Gödel simplified Bernays' theory for his relative consistency proof of the axiom of choice and the generalized continuum hypothesis.[3]

## Contents

* 1 Classes in set theory
* 1.1 The uses of classes
* 1.2 Axiom schema versus class existence theorem
* 2 Axiomatization of NBG
* 2.1 Classes and sets
* 2.2 Definitions and axioms of extensionality and pairing
* 2.3 Class existence axioms and axiom of regularity
* 2.4 Class existence theorem
* 2.5 Extending the class existence theorem
* 2.6 Set axioms
* 2.7 Axiom of global choice
* 3 History
* 3.1 Von Neumann's 1925 axiom system
* 3.2 Von Neumann's 1929 axiom system
* 3.3 Bernays' axiom system
* 3.4 Gödel's axiom system (NBG)
* 4 NBG, ZFC, and MK
* 4.1 Models
* 5 Category theory
* 6 Notes
* 7 References
* 8 Bibliography
* 9 External links

## Classes in set theory

### The uses of classes

Classes have several uses in NBG:

* They produce a finite axiomatization of set theory.[4]
* They are used to state a "very strong form of the axiom of choice"[5]—namely, the axiom of global choice: There exists a global choice function G defined on the class of all nonempty sets such that G(x)∈x for every nonempty set x. This is stronger than ZFC's axiom of choice: For every set s of nonempty sets, there exists a choice function f defined on s such that f(x)∈x for all x∈s.[lower-alpha 1]
* The set-theoretic paradoxes are handled by recognizing that some classes cannot be sets. For example, assume that the class Ord of all ordinals is a set. Then Ord is a transitive set well-ordered by ∈. So, by definition, Ord is an ordinal. Hence, Ord∈Ord, which contradicts ∈ being a well-ordering of Ord. Therefore, Ord is not a set. A class that is not a set is called a proper class; Ord is a proper class.[6]
* Proper classes are useful in constructions. In his proof of the relative consistency of the axiom of global choice and the generalized continuum hypothesis, Gödel used proper classes to build the constructible universe. He constructed a function on the class of all ordinals that, for each ordinal, builds a constructible set by applying a set-building operation to previously constructed sets. The constructible universe is the image of this function.[7]

### Axiom schema versus class existence theorem

Once classes are added to the language of ZFC, it is easy to transform ZFC into a set theory with classes. First, the axiom schema of class comprehension is added. This axiom schema states: For every formula ϕ(x1,…,xn) that quantifies only over sets, there exists a class A consisting of the n-tuples satisfying the formula—that is, ∀x1⋯∀xn[(x1,…,xn)∈A⟺ϕ(x1,…,xn)]. Then the axiom schema of replacement is replaced by a single axiom that uses a class. Finally, ZFC's axiom of extensionality is modified to handle classes: If two classes have the same elements, then they are identical. The other axioms of ZFC are not modified.[8]

This theory is not finitely axiomatized. ZFC's replacement schema has been replaced by a single axiom, but the axiom schema of class comprehension has been introduced.

To produce a theory with finitely many axioms, the axiom schema of class comprehension is first replaced with finitely many class existence axioms. Then these axioms are used to prove the class existence theorem, which implies every instance of the axiom schema.[8] The proof of this theorem requires only seven class existence axioms, which are used to convert the construction of a formula into the construction of a class satisfying the formula.

## Axiomatization of NBG

### Classes and sets

NBG has two types of objects: classes and sets. Intuitively, every set is also a class. There are two ways to axiomatize this.[non-primary source needed] Bernays used many-sorted logic with two sorts: classes and sets.[2] Gödel avoided sorts by introducing primitive predicates: ℭ𝔩𝔰(A) for "A is a class" and 𝔐(A) for "A is a set" (in German, "set" is Menge). He also introduced axioms stating that every set is a class and that if class A is a member of a class, then A is a set.[9] Using predicates is the standard way to eliminate sorts. Elliott Mendelson modified Gödel's approach by having everything be a class and defining the set predicate M(A) as ∃C(A∈C).[10] This modification eliminates Gödel's class predicate and his two axioms.

Bernays' two-sorted approach may appear more natural at first, but it creates a more complex theory.[lower-alpha 2] In Bernays' theory, every set has two representations: one as a set and the other as a class. Also, there are two membership relations: the first, denoted by "∈", is between two sets; the second, denoted by "η", is between a set and a class.[2] This redundancy is required by many-sorted logic because variables of different sorts range over disjoint subdomains of the domain of discourse.

The differences between these two approaches do not affect what can be proved, but they do affect how statements are written. In Gödel's approach, A∈C where A and C are classes is a valid statement. In Bernays' approach this statement has no meaning. However, if A is a set, there is an equivalent statement: Define "set a represents class A" if they have the same sets as members—that is, ∀x(x∈a⟺xηA). The statement aηC where set a represents class A is equivalent to Gödel's A∈C.[2]

The approach adopted in this article is that of Gödel with Mendelson's modification. This means that NBG is an axiomatic system in first-order predicate logic with equality, and its only primitive notions are of classes and the membership relation.

### Definitions and axioms of extensionality and pairing

A set is a class that belongs to at least one class: A is a set if and only if ∃C(A∈C). A class that is not a set is called a proper class: A is a proper class if and only if ∀C(A∉C).[12] Therefore, every class is either a set or a proper class, and no class is both.

Gödel introduced the convention that uppercase variables range over classes, while lowercase variables range over sets.[9] Gödel also used names that begin with an uppercase letter to denote particular classes, including functions and relations defined on the class of all sets. Gödel's convention is used in this article. It allows us to write:

* ∃xϕ(x) instead of ∃x(∃C(x∈C)∧ϕ(x))
* ∀xϕ(x) instead of ∀x(∃C(x∈C)⟹ϕ(x))

The following axioms and definitions are needed for the proof of the class existence theorem.

Axiom of extensionality. If two classes have the same elements, then they are identical.

∀A∀B[∀x(x∈A⟺x∈B)⟹A=B] [13]

This axiom generalizes ZFC's axiom of extensionality to classes.

Axiom of pairing. If x and y are sets, then there exists a set p whose only members are x and y.

∀x∀y∃p∀z[z∈p⟺(z=x∨z=y)] [14]

As in ZFC, the axiom of extensionality implies the uniqueness of the set p, which allows us to introduce the notation {x,y}.

Ordered pairs are defined by:

(x,y)={{x},{x,y}}

Tuples are defined inductively using ordered pairs:

(x1)=x1,
For n>1:(x1,…,xn−1,xn)=((x1,…,xn−1),xn).[lower-alpha 3]

### Class existence axioms and axiom of regularity

Class existence axioms will be used to prove the class existence theorem: For every formula in n free set variables that quantifies only over sets, there exists a class of n-tuples that satisfy it. The following example starts with two classes that are functions and builds a composite function. This example illustrates the techniques that are needed to prove the class existence theorem, which lead to the class existence axioms that are needed.

Example 1: If the classes F and G are functions, then the composite function G∘F is defined by the formula: ∃t[(x,t)∈F∧(t,y)∈G]. Since this formula has two free set variables, x and y, the class existence theorem constructs the class of ordered pairs: G∘F={(x,y):∃t[(x,t)∈F∧(t,y)∈G]}.

Because this formula is built from simpler formulas using conjunction ∧ and existential quantification ∃, class operations are needed that take classes representing the simpler formulas and produce classes representing the formulas with ∧ and ∃. To produce a class representing a formula with ∧, intersection is used since x∈A∩B⟺x∈A∧x∈B. To produce a class representing a formula with ∃, the domain is used since x∈Dom(A)⟺∃t[(x,t)∈A].

Before taking the intersection, the tuples in F and G need an extra component so they have the same variables. The component y is added to the tuples of F and x is added to the tuples of G: F′={(x,t,y):(x,t)∈F} and G′={(t,y,x):(t,y)∈G}. In the definition of F′, the variable y is not restricted by the statement (x,t)∈F, so y ranges over the class V of all sets. Similarly, in the definition of G′, the variable x ranges over V. So an axiom is needed that adds an extra component (whose values range over V) to the tuples of a given class.

Next, the variables are put in the same order to prepare for the intersection: F″={(x,y,t):(x,t)∈F} and G″={(x,y,t):(t,y)∈G}. To go from F′ to F″ and from G′ to G″ requires two different permutations, so axioms that support permutations of tuple components are needed.

The intersection of F″ and G″ handles ∧: F″∩G″={(x,y,t):(x,t)∈F∧(t,y)∈G}.

Since (x,y,t) is defined as ((x,y),t), taking the domain of F″∩G″ handles ∃t and produces the composite function: G∘F=Dom(F″∩G″)={(x,y):∃t((x,t)∈F∧(t,y)∈G)} So axioms of intersection and domain are needed.

The class existence axioms are divided into two groups: axioms handling language primitives and axioms handling tuples. There are four axioms in the first group and three axioms in the second group.[lower-alpha 4]

Axioms for handling language primitives:

Membership. There exists a class E containing all the ordered pairs whose first component is a member of the second component.

∃E∀x∀y[(x,y)∈E⟺x∈y] [18]

Intersection (conjunction). For any two classes A and B, there is a class C consisting precisely of the sets that belong to both A and B.

∀A∀B∃C∀x[x∈C⟺(x∈A∧x∈B)] [19]

Complement (negation). For any class A, there is a class B consisting precisely of the sets not belonging to A.

∀A∃B∀x[x∈B⟺¬(x∈A)] [20]

Domain (existential quantifier). For any class A, there is a class B consisting precisely of the first components of the ordered pairs of A.

∀A∃B∀x[x∈B⟺∃y((x,y)∈A)] [21]

By the axiom of extensionality, class C in the intersection axiom and class B in the complement and domain axioms are unique. They will be denoted by: A∩B, ∁(A), and Dom(A), respectively.[lower-alpha 5]

The first three axioms imply the existence of the empty class and the class of all sets: The membership axiom implies the existence of a class E. The intersection and complement axioms imply the existence of E∩∁(E), which is empty. By the axiom of extensionality, this class is unique; it is denoted by ∅. The complement of ∅ is the class V of all sets, which is also unique by extensionality. The set predicate M(A), which was defined as ∃C(A∈C), is now redefined as A∈V to avoid quantifying over classes.

Axioms for handling tuples:

Product by V. For any class A, there is a class B consisting of the ordered pairs whose first component belongs to A.

∀A∃B∀u[u∈B⟺∃x∃y(u=(x,y)∧x∈A)][23]

Circular permutation. For any class A, there is a class B whose 3‑tuples are obtained by applying the circular permutation (y,z,x)↦(x,y,z) to the 3‑tuples of A.

∀A∃B∀x∀y∀z[(x,y,z)∈B⟺(y,z,x)∈A][24]

Transposition. For any class A, there is a class B whose 3‑tuples are obtained by transposing the last two components of the 3‑tuples of A.

∀A∃B∀x∀y∀z[(x,y,z)∈B⟺(x,z,y)∈A][25]

By extensionality, the product by V axiom implies the existence of a unique class, which is denoted by A×V. This axiom is used to define the class Vn of all n-tuples: V1=V and Vn+1=Vn×V. If A is a class, extensionality implies that A∩Vn is the unique class consisting of the n-tuples of A. For example, the membership axiom produces a class E that may contain elements that are not ordered pairs, while the intersection E∩V2 contains only the ordered pairs of E.

The circular permutation and transposition axioms do not imply the existence of unique classes because they specify only the 3‑tuples of class B. By specifying the 3‑tuples, these axioms also specify the n-tuples for n≥4 since: (x1,…,xn−2,xn−1,xn)=((x1,…,xn−2),xn−1,xn). The axioms for handling tuples and the domain axiom imply the following lemma, which is used in the proof of the class existence theorem.

Tuple lemma --

1. ∀A∃B1∀x∀y∀z[(z,x,y)∈B1⟺(x,y)∈A]
2. ∀A∃B2∀x∀y∀z[(x,z,y)∈B2⟺(x,y)∈A]
3. ∀A∃B3∀x∀y∀z[(x,y,z)∈B3⟺(x,y)∈A]
4. ∀A∃B4∀x∀y∀z[(y,x)∈B4⟺(x,y)∈A]

Proof

* Class B3: Apply product by V to A to produce B3.
* Class B2: Apply transposition to B3 to produce B2.
* Class B1: Apply circular permutation to B3 to produce B1.
* Class B4: Apply circular permutation to B2, then apply domain to produce B4.

One more axiom is needed to prove the class existence theorem: the axiom of regularity. Since the existence of the empty class has been proved, the usual statement of this axiom is given.[lower-alpha 6]

Axiom of regularity. Every nonempty set has at least one element with which it has no element in common. ∀a[a≠∅⟹∃u(u∈a∧u∩a=∅)].

This axiom implies that a set cannot belong to itself: Assume that x∈x and let a={x}. Then x∩a≠∅ since x∈x∩a. This contradicts the axiom of regularity because x is the only element in a. Therefore, x∉x. The axiom of regularity also prohibits infinite descending membership sequences of sets: ⋯∈xn+1∈xn∈⋯∈x1∈x0.

Gödel stated regularity for classes rather than for sets in his 1940 monograph, which was based on lectures given in 1938.[26] In 1939, he proved that regularity for sets implies regularity for classes.[27]

### Class existence theorem

Class existence theorem -- Let ϕ(x1,…,xn,Y1,…,Ym) be a formula that quantifies only over sets and contains no free variables other than x1,…,xn,Y1,…,Ym (not necessarily all of these). Then for all Y1,…,Ym, there exists a unique class A of n-tuples such that: ∀x1⋯∀xn[(x1,…,xn)∈A⟺ϕ(x1,…,xn,Y1,…,Ym)]. The class A is denoted by {(x1,…,xn):ϕ(x1,…,xn,Y1,…,Ym)}.[lower-alpha 7]

The theorem's proof will be done in two steps:

1. Transformation rules are used to transform the given formula ϕ into an equivalent formula that simplifies the inductive part of the proof. For example, the only logical symbols in the transformed formula are ¬, ∧, and ∃, so the induction handles logical symbols with just three cases.
2. The class existence theorem is proved inductively for transformed formulas. Guided by the structure of the transformed formula, the class existence axioms are used to produce the unique class of n-tuples satisfying the formula.

Transformation rules. In rules 1 and 2 below, Δ and Γ denote set or class variables. These two rules eliminate all occurrences of class variables before an ∈ and all occurrences of equality. Each time rule 1 or 2 is applied to a subformula, i is chosen so that zi differs from the other variables in the current formula. The three rules are repeated until there are no subformulas to which they can be applied. This produces a formula that is built only with ¬, ∧, ∃, ∈, set variables, and class variables Yk where Yk does not appear before an ∈.

1. Yk∈Γ is transformed into ∃zi(zi=Yk∧zi∈Γ).
2. Extensionality is used to transform Δ=Γ into ∀zi(zi∈Δ⟺zi∈Γ).
3. Logical identities are used to transform subformulas containing ∨,⟹,⟺, and ∀ to subformulas that only use ¬,∧, and ∃.

Transformation rules: bound variables. Consider the composite function formula of example 1 with its free set variables replaced by x1 and x2: ∃t[(x1,t)∈F∧(t,x2)∈G]. The inductive proof will remove ∃t, which produces the formula (x1,t)∈F∧(t,x2)∈G. However, since the class existence theorem is stated for subscripted variables, this formula does not have the form expected by the induction hypothesis. This problem is solved by replacing the variable t with x3. Bound variables within nested quantifiers are handled by increasing the subscript by one for each successive quantifier. This leads to rule 4, which must be applied after the other rules since rules 1 and 2 produce quantified variables.

1.   2. If a formula contains no free set variables other than x1,…,xn, then bound variables that are nested within q quantifiers are replaced with xn+q. These variables have (quantifier) nesting depth q.

Example 2: Rule 4 is applied to the formula ϕ(x1) that defines the class consisting of all sets of the form {∅,{∅,…},…}. That is, sets that contain at least ∅ and a set containing ∅ — for example, {∅,{∅,a,b,c},d,e} where a,b,c,d, and e are sets.

ϕ(x1)=∃u[u∈x1∧¬∃v(v∈u)]∧∃w(w∈x1∧∃y[(y∈w∧¬∃z(z∈y)])ϕr(x1)=∃x2[x2∈x1∧¬∃x3(x3∈x2)]∧∃x2(x2∈x1∧∃x3[(x3∈x2∧¬∃x4(x4∈x3)])

Since x1 is the only free variable, n=1. The quantified variable x3 appears twice in x3∈x2 at nesting depth 2. Its subscript is 3 because n+q=1+2=3. If two quantifier scopes are at the same nesting depth, they are either identical or disjoint. The two occurrences of x3 are in disjoint quantifier scopes, so they do not interact with each other.

Proof of the class existence theorem. The proof starts by applying the transformation rules to the given formula to produce a transformed formula. Since this formula is equivalent to the given formula, the proof is completed by proving the class existence theorem for transformed formulas.

Proof of the class existence theorem for transformed formulas

The following lemma is used in the proof.

Expansion lemma -- Let 1≤i<j≤n, and let P be a class containing all the ordered pairs (xi,xj) satisfying R(xi,xj). That is, P⊇{(xi,xj):R(xi,xj)}. Then P can be expanded into the unique class Q of n-tuples satisfying R(xi,xj). That is, Q={(x1,…,xn):R(xi,xj)}.

Proof:

1. If i=1, let P1=P.

Otherwise, i>1, so components are added in front of xi: apply the tuple lemma's statement 1 to P with z=(x1,…,xi−1). This produces a class P1 containing all the (i+1)-tuples ((x1,…,xi−1),xi,xj)=(x1,…,xi−1,xi,xj) satisfying R(xi,xj).
2. If j=i+1, let P2=P1.

Otherwise, j>i+1, so components are added between xi and xj: add the components xi+1,…,xj−1 one by one using the tuple lemma's statement 2. This produces a class P2 containing all the j-tuples (((⋯((x1,…,xi),xi+1),⋯),xj−1),xj)=(x1,…,xj) satisfying R(xi,xj).
3. If j=n, let P3=P2.

Otherwise, j<n, so components are added after xj: add the components xj+1,…,xn one by one using the tuple lemma's statement 3. This produces a class P3 containing all the n-tuples ((⋯((x1,…,xj),xj+1),⋯),xn)=(x1,…,xn) satisfying R(xi,xj).
4. Let Q=P3∩Vn. Extensionality implies that Q is the unique class of n-tuples satisfying R(xi,xj).

Class existence theorem for transformed formulas -- Let ϕ(x1,…,xn,Y1,…,Ym) be a formula that:

1. contains no free variables other than x1,…,xn,Y1,…,Ym;
2. contains only ∈, ¬, ∧, ∃, set variables, and the class variables Yk where Yk does not appear before an ∈ ;
3. only quantifies set variables xn+q where q is the quantifier nesting depth of the variable.

Then for all Y1,…,Ym, there exists a unique class A of n-tuples such that: ∀x1⋯∀xn[(x1,…,xn)∈A⟺ϕ(x1,…,xn,Y1,…,Ym)].

Proof: Basis step: ϕ has 0 logical symbols. The theorem's hypothesis implies that ϕ is an atomic formula of the form xi∈xj or xi∈Yk.

Case 1: If ϕ is xi∈xj, we build the class Ei,j,n={(x1,…,xn):xi∈xj}, the unique class of n-tuples satisfying xi∈xj.

Case a: ϕ is xi∈xj where i<j. The axiom of membership produces a class P containing all the ordered pairs (xi,xj) satisfying xi∈xj. Apply the expansion lemma to P to obtain Ei,j,n={(x1,…,xn):xi∈xj}.

Case b: ϕ is xi∈xj where i>j. The axiom of membership produces a class P containing all the ordered pairs (xi,xj) satisfying xi∈xj. Apply the tuple lemma's statement 4 to P to obtain P′ containing all the ordered pairs (xj,xi) satisfying xi∈xj. Apply the expansion lemma to P′ to obtain Ei,j,n={(x1,…,xn):xi∈xj}.

Case c: ϕ is xi∈xj where i=j. Since this formula is false by the axiom of regularity, no n-tuples satisfy it, so Ei,j,n=∅.

Case 2: If ϕ is xi∈Yk, we build the class Ei,Yk,n={(x1,…,xn):xi∈Yk}, the unique class of n-tuples satisfying xi∈Yk.

Case a: ϕ is xi∈Yk where i<n. Apply the axiom of product by V to Yk to produce the class P=Yk×V={(xi,xi+1):xi∈Yk}. Apply the expansion lemma to P to obtain Ei,Yk,n={(x1,…,xn):xi∈Yk}.

Case b: ϕ is xi∈Yk where i=n>1. Apply the axiom of product by V to Yk to produce the class P=Yk×V={(xi,xi−1):xi∈Yk}. Apply the tuple lemma's statement 4 to P to obtain P′=V×Yk={(xi−1,xi):xi∈Yk}. Apply the expansion lemma to P′ to obtain Ei,Yk,n={(x1,…,xn):xi∈Yk}.

Case c: ϕ is xi∈Yk where i=n=1. Then Ei,Yk,n=Yk.

Inductive step: ϕ has k logical symbols where k>0. Assume the induction hypothesis that the theorem is true for all ψ with less than k logical symbols. We now prove the theorem for ϕ with k logical symbols. In this proof, the list of class variables Y1,…,Ym is abbreviated by Y→, so a formula—such as ϕ(x1,…,xn,Y1,…,Ym)—can be written as ϕ(x1,…,xn,Y→).

Case 1: ϕ(x1,…,xn,Y→)=¬ψ(x1,…,xn,Y→). Since ψ has k−1 logical symbols, the induction hypothesis implies that there is a unique class A of n-tuples such that: (x1,…,xn)∈A⟺ψ(x1,…,xn,Y→). By the complement axiom, there is a class ∁(A) such that ∀u[u∈∁(A)⟺¬(u∈A)]. However, ∁(A) contains elements other than n-tuples if n>1. To eliminate these elements, use ∁Vn(A)=∁(A)∩Vn=Vn∖A, which is the complement relative to the class Vn of all n-tuples.[lower-alpha 5] Then, by extensionality, ∁VnA is the unique class of n-tuples such that: (x1,…,xn)∈∁Vn(A)⟺¬[(x1,…,xn)∈A]⟺¬ψ(x1,…,xn,Y→)⟺ϕ(x1,…,xn,Y→).

Case 2: ϕ(x1,…,xn,Y→)=ψ1(x1,…,xn,Y→)∧ψ2(x1,…,xn,Y→). Since both ψ1 and ψ2 have less than k logical symbols, the induction hypothesis implies that there are unique classes of n-tuples, A1 and A2, such that:

(x1,…,xn)∈A1⟺ψ1(x1,…,xn,Y→).(x1,…,xn)∈A2⟺ψ2(x1,…,xn,Y→).

By the axioms of intersection and extensionality, A1∩A2 is the unique class of n-tuples such that: (x1,…,xn)∈A1∩A2⟺(x1,…,xn)∈A1∧(x1,…,xn)∈A2⟺ψ1(x1,…,xn,Y→)∧ψ2(x1,…,xn,Y→)⟺ϕ(x1,…,xn,Y→).

Case 3: ϕ(x1,…,xn,Y→)=∃xn+1ψ(x1,…,xn,xn+1,Y→). The quantifier nesting depth of ψ is one more than that of ϕ and the additional free variable is xn+1. Since ψ has k−1 logical symbols, the induction hypothesis implies that there is a unique class A of (n+1)-tuples such that: (x1,…,xn,xn+1)∈A⟺ψ(x1,…,xn,xn+1,Y→). By the axioms of domain and extensionality, Dom(A) is the unique class of n-tuples such that:[lower-alpha 8] (x1,…,xn)∈Dom(A)⟺∃xn+1[((x1,…,xn),xn+1)∈A]⟺∃xn+1[(x1,…,xn,xn+1)∈A]⟺∃xn+1ψ(x1,…,xn,xn+1,Y→)⟺ϕ(x1,…,xn,Y→).

Gödel pointed out that the class existence theorem "is a metatheorem, that is, a theorem about the system [NBG], not in the system …"[30] It is a theorem about NBG because it is proved in the metatheory by induction on NBG formulas. Also, its proof—instead of invoking finitely many NBG axioms—inductively describes how to use NBG axioms to construct a class satisfying a given formula. For every formula, this description can be turned into a constructive existence proof that is in NBG. Therefore, this metatheorem can generate the NBG proofs that replace uses of NBG's class existence theorem.

A recursive computer program succinctly captures the construction of a class from a given formula. The definition of this program does not depend on the proof of the class existence theorem. However, the proof is needed to prove that the class constructed by the program satisfies the given formula and is built using the axioms. This program is written in pseudocode that uses a Pascal-style case statement.[lower-alpha 9] 𝐟𝐮𝐧𝐜𝐭𝐢𝐨𝐧Class(ϕ,n)𝐢𝐧𝐩𝐮𝐭:ϕ is a transformed formula of the form ϕ(x1,…,xn,Y1,…,Ym);n specifies that a class of n-tuples is returned.𝐨𝐮𝐭𝐩𝐮𝐭:class A of n-tuples satisfying ∀x1⋯∀xn[(x1,…,xn)∈A⟺ϕ(x1,…,xn,Y1,…,Ym)].𝐛𝐞𝐠𝐢𝐧𝐜𝐚𝐬𝐞ϕ𝐨𝐟xi∈xj:𝐫𝐞𝐭𝐮𝐫𝐧Ei,j,n;// Ei,j,n={(x1,…,xn):xi∈xj}xi∈Yk:𝐫𝐞𝐭𝐮𝐫𝐧Ei,Yk,n;// Ei,Yk,n={(x1,…,xn):xi∈Yk}¬ψ:𝐫𝐞𝐭𝐮𝐫𝐧∁VnClass(ψ,n);// ∁VnClass(ψ,n)=Vn∖Class(ψ,n)ψ1∧ψ2:𝐫𝐞𝐭𝐮𝐫𝐧Class(ψ1,n)∩Class(ψ2,n);∃xn+1(ψ):𝐫𝐞𝐭𝐮𝐫𝐧Dom(Class(ψ,n+1));// xn+1 is free in ψ; Class(ψ,n+1) // returns a class of (n+1)-tuples𝐞𝐧𝐝𝐞𝐧𝐝

Let ϕ be the formula of example 2. The function call A=Class(ϕ,1) generates the class A, which is compared below with ϕ. This shows that the construction of the class A mirrors the construction of its defining formula ϕ.

ϕ=∃x2(x2∈x1∧¬∃x3(x3∈x2))∧∃x2(x2∈x1∧∃x3(x3∈x2∧¬∃x4(x4∈x3)))A=Dom(E2,1,2∩∁V2Dom(E3,2,3))∩Dom(E2,1,2∩Dom(E3,2,3∩∁V3Dom(E4,3,4)))

### Extending the class existence theorem

Gödel extended the class existence theorem to formulas ϕ containing relations over classes (such as Y1⊆Y2 and the unary relation M(Y1)), special classes (such as Ord ), and operations (such as (x1,x2) and x1∩Y1).[32] To extend the class existence theorem, the formulas defining relations, special classes, and operations must quantify only over sets. Then ϕ can be transformed into an equivalent formula satisfying the hypothesis of the class existence theorem.

The following definitions specify how formulas define relations, special classes, and operations:

1. A relation R is defined by: R(Z1,…,Zk)⟺ψR(Z1,…,Zk).
2. A special class C is defined by: u∈C⟺ψC(u).
3. An operation P is defined by: u∈P(Z1,…,Zk)⟺ψP(u,Z1,…,Zk).

A term is defined by:

1. Variables and special classes are terms.
2. If P is an operation with k arguments and Γ1,…,Γk are terms, then P(Γ1,…,Γk) is a term.

The following transformation rules eliminate relations, special classes, and operations. Each time rule 2b, 3b, or 4 is applied to a subformula, i is chosen so that zi differs from the other variables in the current formula. The rules are repeated until there are no subformulas to which they can be applied. Γ1,…,Γk,Γ, and Δ denote terms.

1. A relation R(Z1,…,Zk) is replaced by its defining formula ψR(Z1,…,Zk).
2. Let ψC(u) be the defining formula for the special class C.

1. Δ∈C is replaced by ψC(Δ).
2. C∈Δ is replaced by ∃zi[zi=C∧zi∈Δ].

3. Let ψP(u,Z1,…,Zk) be the defining formula for the operation P(Z1,…,Zk).

1. Δ∈P(Γ1,…,Γk) is replaced by ψP(Δ,Γ1,…,Γk).
2. P(Γ1,…,Γk)∈Δ is replaced by ∃zi[zi=P(Γ1,…,Γk)∧zi∈Δ].

4. Extensionality is used to transform Δ=Γ into ∀zi(zi∈Δ⟺zi∈Γ).

Example 3: Transforming Y1⊆Y2.

Y1⊆Y2⟺∀z1(z1∈Y1⟹z1∈Y2)(rule 1)

Example 4: Transforming x1∩Y1∈x2.

x1∩Y1∈x2⟺∃z1[z1=x1∩Y1∧z1∈x2](rule 3b)⟺∃z1[∀z2(z2∈z1⟺z2∈x1∩Y1)∧z1∈x2](rule 4)⟺∃z1[∀z2(z2∈z1⟺z2∈x1∧z2∈Y1)∧z1∈x2](rule 3a)

This example illustrates how the transformation rules work together to eliminate an operation.

Class existence theorem (extended version) -- Let ϕ(x1,…,xn,Y1,…,Ym) be a formula that quantifies only over sets, contains no free variables other than x1,…,xn,Y1,…,Ym, and may contain relations, special classes, and operations defined by formulas that quantify only over sets. Then for all Y1,…,Ym, there exists a unique class A of n-tuples such that ∀x1⋯∀xn[(x1,…,xn)∈A⟺ϕ(x1,…,xn,Y1,…,Ym)].[lower-alpha 10]

Proof

Apply the transformation rules to ϕ to produce an equivalent formula containing no relations, special classes, or operations. This formula satisfies the hypothesis of the class existence theorem. Therefore, for all Y1,…,Ym, there is a unique class A of n-tuples satisfying ∀x1⋯∀xn[(x1,…,xn)∈A⟺ϕ(x1,…,xn,Y1,…,Ym)].

### Set axioms

The axioms of pairing and regularity, which were needed for the proof of the class existence theorem, have been given above. NBG contains four other set axioms. Three of these axioms deal with class operations being applied to sets.

Definition. F is a function if F⊆V2∧∀x∀y∀z[(x,y)∈F∧(x,z)∈F⟹y=z].

In set theory, the definition of a function does not require specifying the domain or codomain of the function (see Function (set theory)). NBG's definition of function generalizes ZFC's definition from a set of ordered pairs to a class of ordered pairs.

ZFC's definitions of the set operations of image, union, and power set are also generalized to class operations. The image of class A under the function F is F[A]={y:∃x(x∈A∧(x,y)∈F)}. This definition does not require that A⊆Dom(F). The union of class A is ∪A={x:∃y(x∈y∧y∈A)}. The power class of A is 𝒫(A)={x:x⊆A}. The extended version of the class existence theorem implies the existence of these classes. The axioms of replacement, union, and power set imply that when these operations are applied to sets, they produce sets.[34]

Axiom of replacement. If F is a function and a is a set, then F[a], the image of a under F, is a set. ∀F∀a[F is a function⟹∃b∀y(y∈b⟺∃x(x∈a∧(x,y)∈F))].

Not having the requirement A⊆Dom(F) in the definition of F[A] produces a stronger axiom of replacement, which is used in the following proof.

Theorem (NBG's axiom of separation) -- If a is a set and B is a subclass of a, then B is a set.

Proof

The class existence theorem constructs the restriction of the identity function to B: I↾B={(x1,x2):x1∈B∧x2=x1}. Since the image of a under I↾B is B, the axiom of replacement implies that B is a set. This proof depends on the definition of image not having the requirement a⊆Dom(F) since Dom(I↾B)=B⊆a rather than a⊆Dom(I↾B).

Axiom of union. If a is a set, then there is a set containing ∪a. ∀a∃b∀x[∃y(x∈y∧y∈a)⟹x∈b].

Axiom of power set. If a is a set, then there is a set containing 𝒫(a).

∀a∃b∀x(x⊆a⟹x∈b).[lower-alpha 11]

Theorem -- If a is a set, then ∪a and 𝒫(a) are sets.

Proof

The axiom of union states that ∪a is a subclass of a set b, so the axiom of separation implies ∪a is a set. Likewise, the axiom of power set states that 𝒫(a) is a subclass of a set b, so the axiom of separation implies that 𝒫(a) is a set.

Axiom of infinity. There exists a nonempty set a such that for all x in a, there exists a y in a such that x is a proper subset of y. ∃a[∃u(u∈a)∧∀x(x∈a⟹∃y(y∈a∧x⊂y))].

The axioms of infinity and replacement prove the existence of the empty set. In the discussion of the class existence axioms, the existence of the empty class ∅ was proved. We now prove that ∅ is a set. Let function F=∅ and let a be the set given by the axiom of infinity. By replacement, the image of a under F, which equals ∅, is a set.

NBG's axiom of infinity is implied by ZFC's axiom of infinity: ∃a[∅∈a∧∀x(x∈a⟹x∪{x}∈a)]. The first conjunct of ZFC's axiom, ∅∈a, implies the first conjunct of NBG's axiom. The second conjunct of ZFC's axiom, ∀x(x∈a⟹x∪{x}∈a), implies the second conjunct of NBG's axiom since x⊂x∪{x}. To prove ZFC's axiom of infinity from NBG's axiom of infinity requires some of the other NBG axioms (see Weak axiom of infinity).[lower-alpha 12]

### Axiom of global choice

The class concept allows NBG to have a stronger axiom of choice than ZFC. A choice function is a function f defined on a set s of nonempty sets such that f(x)∈x for all x∈s. ZFC's axiom of choice states that there exists a choice function for every set of nonempty sets. A global choice function is a function G defined on the class of all nonempty sets such that G(x)∈x for every nonempty set x. The axiom of global choice states that there exists a global choice function. This axiom implies ZFC's axiom of choice since for every set s of nonempty sets, G|s (the restriction of G to s) is a choice function for s. In 1964, William B. Easton proved that global choice is stronger than the axiom of choice by using forcing to construct a model that satisfies the axiom of choice and all the axioms of NBG except the axiom of global choice.[38] The axiom of global choice is equivalent to every class having a well-ordering, while ZFC's axiom of choice is equivalent to every set having a well-ordering.[lower-alpha 13]

Axiom of global choice. There exists a function that chooses an element from every nonempty set.

∃G[G is a function∧∀x(x≠∅⟹∃y(y∈x∧(x,y)∈G))].

## History

History of approaches that led to NBG set theory

### Von Neumann's 1925 axiom system

Von Neumann published an introductory article on his axiom system in 1925. In 1928, he provided a detailed treatment of his system.[39] Von Neumann based his axiom system on two domains of primitive objects: functions and arguments. These domains overlap—objects that are in both domains are called argument-functions. Functions correspond to classes in NBG, and argument-functions correspond to sets. Von Neumann's primitive operation is function application, denoted by [a, x] rather than a(x) where a is a function and x is an argument. This operation produces an argument. Von Neumann defined classes and sets using functions and argument-functions that take only two values, A and B. He defined x ∈ a if [a, x] ≠ A.[1]

Von Neumann's work in set theory was influenced by Georg Cantor's articles, Ernst Zermelo's 1908 axioms for set theory, and the 1922 critiques of Zermelo's set theory that were given independently by Abraham Fraenkel and Thoralf Skolem. Both Fraenkel and Skolem pointed out that Zermelo's axioms cannot prove the existence of the set {Z0, Z1, Z2, ...} where Z0 is the set of natural numbers and Zn+1 is the power set of Zn. They then introduced the axiom of replacement, which would guarantee the existence of such sets.[40][lower-alpha 14] However, they were reluctant to adopt this axiom: Fraenkel stated "that Replacement was too strong an axiom for 'general set theory'", while "Skolem only wrote that 'we could introduce' Replacement".[42]

Von Neumann worked on the problems of Zermelo set theory and provided solutions for some of them:

* A theory of ordinals
* Problem: Cantor's theory of ordinal numbers cannot be developed in Zermelo set theory because it lacks the axiom of replacement.[lower-alpha 15]
* Solution: Von Neumann recovered Cantor's theory by defining the ordinals using sets that are well-ordered by the ∈-relation,[lower-alpha 16] and by using the axiom of replacement to prove key theorems about the ordinals, such as every well-ordered set is order-isomorphic with an ordinal.[lower-alpha 15] In contrast to Fraenkel and Skolem, von Neumann emphasized how important the replacement axiom is for set theory: "In fact, I believe that no theory of ordinals is possible at all without this axiom."[45]
* A criterion identifying classes that are too large to be sets
* Problem: Zermelo did not provide such a criterion. His set theory avoids the large classes that lead to the paradoxes, but it leaves out many sets, such as the one mentioned by Fraenkel and Skolem.[lower-alpha 17]
* Solution: Von Neumann introduced the criterion: A class is too large to be a set if and only if it can be mapped onto the class V of all sets. Von Neumann realized that the set-theoretic paradoxes could be avoided by not allowing such large classes to be members of any class. Combining this restriction with his criterion, he obtained his axiom of limitation of size: A class C is not a member of any class if and only if C can be mapped onto V.[48][lower-alpha 18]
* Finite axiomatization
* Problem: Zermelo had used the imprecise concept of "definite propositional function" in his axiom of separation.
* Solutions: Skolem introduced the axiom schema of separation that was later used in ZFC, and Fraenkel introduced an equivalent solution.[50] However, Zermelo rejected both approaches "particularly because they implicitly involve the concept of natural number which, in Zermelo's view, should be based upon set theory."[lower-alpha 19] Von Neumann avoided axiom schemas by formalizing the concept of "definite propositional function" with his functions, whose construction requires only finitely many axioms. This led to his set theory having finitely many axioms.[51] In 1961, Richard Montague proved that ZFC cannot be finitely axiomatized.[52]
* The axiom of regularity
* Problem: Zermelo set theory starts with the empty set and an infinite set, and iterates the axioms of pairing, union, power set, separation, and choice to generate new sets. However, it does not restrict sets to these. For example, it allows sets that are not well-founded, such as a set x satisfying x ∈ x.[lower-alpha 20]
* Solutions: Fraenkel introduced an axiom to exclude these sets. Von Neumann analyzed Fraenkel's axiom and stated that it was not "precisely formulated", but it would approximately say: "Besides the sets ... whose existence is absolutely required by the axioms, there are no further sets."[54] Von Neumann proposed the axiom of regularity as a way to exclude non-well-founded sets, but did not include it in his axiom system. In 1930, Zermelo became the first to publish an axiom system that included regularity.[lower-alpha 21]

### Von Neumann's 1929 axiom system

John von Neumann

In 1929, von Neumann published an article containing the axioms that would lead to NBG. This article was motivated by his concern about the consistency of the axiom of limitation of size. He stated that this axiom "does a lot, actually too much." Besides implying the axioms of separation and replacement, and the well-ordering theorem, it also implies that any class whose cardinality is less than that of V is a set. Von Neumann thought that this last implication went beyond Cantorian set theory and concluded: "We must therefore discuss whether its [the axiom's] consistency is not even more problematic than an axiomatization of set theory that does not go beyond the necessary Cantorian framework."[57]

Von Neumann started his consistency investigation by introducing his 1929 axiom system, which contains all the axioms of his 1925 axiom system except the axiom of limitation of size. He replaced this axiom with two of its consequences, the axiom of replacement and a choice axiom. Von Neumann's choice axiom states: "Every relation R has a subclass that is a function with the same domain as R."[58]

Let S be von Neumann's 1929 axiom system. Von Neumann introduced the axiom system S \+ Regularity (which consists of S and the axiom of regularity) to demonstrate that his 1925 system is consistent relative to S. He proved:

1. If S is consistent, then S \+ Regularity is consistent.
2. S \+ Regularity implies the axiom of limitation of size. Since this is the only axiom of his 1925 axiom system that S \+ Regularity does not have, S \+ Regularity implies all the axioms of his 1925 system.

These results imply: If S is consistent, then von Neumann's 1925 axiom system is consistent. Proof: If S is consistent, then S \+ Regularity is consistent (result 1). Using proof by contradiction, assume that the 1925 axiom system is inconsistent, or equivalently: the 1925 axiom system implies a contradiction. Since S \+ Regularity implies the axioms of the 1925 system (result 2), S \+ Regularity also implies a contradiction. However, this contradicts the consistency of S \+ Regularity. Therefore, if S is consistent, then von Neumann's 1925 axiom system is consistent.

Since S is his 1929 axiom system, von Neumann's 1925 axiom system is consistent relative to his 1929 axiom system, which is closer to Cantorian set theory. The major differences between Cantorian set theory and the 1929 axiom system are classes and von Neumann's choice axiom. The axiom system S \+ Regularity was modified by Bernays and Gödel to produce the equivalent NBG axiom system.

### Bernays' axiom system

File:ETH-BIB-Bernays, Paul (1888-1977)-Portrait-Portr 00025 (cropped).tif In 1929, Paul Bernays started modifying von Neumann's new axiom system by taking classes and sets as primitives. He published his work in a series of articles appearing from 1937 to 1954.[59] Bernays stated that:

> The purpose of modifying the von Neumann system is to remain nearer to the structure of the original Zermelo system and to utilize at the same time some of the set-theoretic concepts of the Schröder logic and of Principia Mathematica which have become familiar to logicians. As will be seen, a considerable simplification results from this arrangement.[60]

Bernays handled sets and classes in a two-sorted logic and introduced two membership primitives: one for membership in sets and one for membership in classes. With these primitives, he rewrote and simplified von Neumann's 1929 axioms. Bernays also included the axiom of regularity in his axiom system.[61]

### Gödel's axiom system (NBG)

Kurt Gödel,  c. 1926

In 1931, Bernays sent a letter containing his set theory to Kurt Gödel.[36] Gödel simplified Bernays' theory by making every set a class, which allowed him to use just one sort and one membership primitive. He also weakened some of Bernays' axioms and replaced von Neumann's choice axiom with the equivalent axiom of global choice.[62][lower-alpha 22] Gödel used his axioms in his 1940 monograph on the relative consistency of global choice and the generalized continuum hypothesis.[63]

Several reasons have been given for Gödel choosing NBG for his monograph:[lower-alpha 23]

* Gödel gave a mathematical reason—NBG's global choice produces a stronger consistency theorem: "This stronger form of the axiom [of choice], if consistent with the other axioms, implies, of course, that a weaker form is also consistent."[5]
* Robert Solovay conjectured: "My guess is that he [Gödel] wished to avoid a discussion of the technicalities involved in developing the rudiments of model theory within axiomatic set theory."[67][lower-alpha 24]
* Kenneth Kunen gave a reason for Gödel avoiding this discussion: "There is also a much more combinatorial approach to L [the constructible universe], developed by ... [Gödel in his 1940 monograph] in an attempt to explain his work to non-logicians. ... This approach has the merit of removing all vestiges of logic from the treatment of L."[68]
* Charles Parsons provided a philosophical reason for Gödel's choice: "This view [that 'property of set' is a primitive of set theory] may be reflected in Gödel's choice of a theory with class variables as the framework for ... [his monograph]."[69]

Gödel's achievement together with the details of his presentation led to the prominence that NBG would enjoy for the next two decades.[70] In 1963, Paul Cohen proved his independence proofs for ZF with the help of some tools that Gödel had developed for his relative consistency proofs for NBG.[71] Later, ZFC became more popular than NBG. This was caused by several factors, including the extra work required to handle forcing in NBG,[72] Cohen's 1966 presentation of forcing, which used ZF,[73][lower-alpha 25] and the proof that NBG is a conservative extension of ZFC.[lower-alpha 26]

## NBG, ZFC, and MK

NBG is not logically equivalent to ZFC because its language is more expressive: it can make statements about classes, which cannot be made in ZFC. However, NBG and ZFC imply the same statements about sets. Therefore, NBG is a conservative extension of ZFC. NBG implies theorems that ZFC does not imply, but since NBG is a conservative extension, these theorems must involve proper classes. For example, it is a theorem of NBG that the global axiom of choice implies that the proper class V can be well-ordered and that every proper class can be put into one-to-one correspondence with V.[lower-alpha 27]

One consequence of conservative extension is that ZFC and NBG are equiconsistent. Proving this uses the principle of explosion: from a contradiction, everything is provable. Assume that either ZFC or NBG is inconsistent. Then the inconsistent theory implies the contradictory statements ∅ = ∅ and ∅ ≠ ∅, which are statements about sets. By the conservative extension property, the other theory also implies these statements. Therefore, it is also inconsistent. So although NBG is more expressive, it is equiconsistent with ZFC. This result together with von Neumann's 1929 relative consistency proof implies that his 1925 axiom system with the axiom of limitation of size is equiconsistent with ZFC. This completely resolves von Neumann's concern about the relative consistency of this powerful axiom since ZFC is within the Cantorian framework.

Even though NBG is a conservative extension of ZFC, a theorem may have a shorter and more elegant proof in NBG than in ZFC (or vice versa). For a survey of known results of this nature, see Pudlák 1998.

Morse–Kelley set theory has an axiom schema of class comprehension that includes formulas whose quantifiers range over classes. MK is a stronger theory than NBG because MK proves the consistency of NBG,[76] while Gödel's second incompleteness theorem implies that NBG cannot prove the consistency of NBG.

For a discussion of some ontological and other philosophical issues posed by NBG, especially when contrasted with ZFC and MK, see Appendix C of Potter 2004.

### Models

ZFC, NBG, and MK have models describable in terms of the cumulative hierarchy Vα and the constructible hierarchy Lα . Let V include an inaccessible cardinal κ, let X ⊆ Vκ, and let Def(X) denote the class of first-order definable subsets of X with parameters. In symbols where "(X,∈)" denotes the model with domain X and relation ∈, and "⊨" denotes the satisfaction relation: Def⁡(X):={{x∣x∈X and (X,∈)⊨ϕ(x,y1,…,yn)}:ϕ is a first-order formula and y1,…,yn∈X}.

Then:

* (Vκ,∈) and (Lκ,∈) are models of ZFC.[77]
* (Vκ, Vκ+1, ∈) is a model of MK where Vκ consists of the sets of the model and Vκ+1 consists of the classes of the model.[78] Since a model of MK is a model of NBG, this model is also a model of NBG.
* (Vκ, Def(Vκ), ∈) is a model of Mendelson's version of NBG, which replaces NBG's axiom of global choice with ZFC's axiom of choice.[79] The axioms of ZFC are true in this model because (Vκ, ∈) is a model of ZFC. In particular, ZFC's axiom of choice holds, but NBG's global choice may fail.[lower-alpha 28] NBG's class existence axioms are true in this model because the classes whose existence they assert can be defined by first-order definitions. For example, the membership axiom holds since the class E is defined by: E={x∈Vκ:(Vκ,∈)⊨∃u ∃v[x=(u,v)∧u∈v]}.
* (Lκ, Lκ+, ∈), where κ+ is the successor cardinal of κ, is a model of NBG.[lower-alpha 29] NBG's class existence axioms are true in (Lκ, Lκ+, ∈). For example, the membership axiom holds since the class E is defined by: E={x∈Lκ:(Lκ,∈)⊨∃u ∃v[x=(u,v)∧u∈v]}. So E ∈ 𝒫(Lκ). In his proof that GCH is true in L, Gödel proved that 𝒫(Lκ) ⊆ Lκ+.[81] Therefore, E ∈ Lκ+, so the membership axiom is true in (Lκ, Lκ+, ∈). Likewise, the other class existence axioms are true. The axiom of global choice is true because Lκ is well-ordered by the restriction of Gödel's function (which maps the class of ordinals to the constructible sets) to the ordinals less than κ. Therefore, (Lκ, Lκ+, ∈) is a model of NBG.
* If M is a nonstandard model of ZFC, then (M,Def(M))⊨NBG+Δ11-CA is equivalent to "there exists an X such that (M,X)⊨NBG+Δ11-CA", where Def(M) is the set of subsets of M that are definable over M.[82] This provides a second-order part for extending a given first-order nonstandard model of ZFC to a nonstandard model of NBG, if there is such an extension at all.

## Category theory

The ontology of NBG provides scaffolding for speaking about "large objects" without risking paradox. For instance, in some developments of category theory, a "large category" is defined as one whose objects and morphisms make up a proper class. On the other hand, a "small category" is one whose objects and morphisms are members of a set. Thus, we can speak of the "category of all sets" or "category of all small categories" without risking paradox since NBG supports large categories.

However, NBG does not support a "category of all categories" since large categories would be members of it and NBG does not allow proper classes to be members of anything. An ontological extension that enables us to talk formally about such a "category" is the conglomerate, which is a collection of classes. Then the "category of all categories" is defined by its objects: the conglomerate of all (large) categories; and its morphisms: the conglomerate of all morphisms from A to B where A and B are objects.[83] On whether an ontology including classes as well as sets is adequate for category theory, see Muller 2001.

## Notes

1. ↑ Axiom of global choice explains why it is provably stronger.
2. ↑ The historical development suggests that the two-sorted approach does appear more natural at first. In introducing his theory, Bernays stated: "According to the leading idea of von Neumann set theory we have to deal with two kinds of individuals, which we may distinguish as sets and classes."[11]
3. ↑ Gödel defined (x1,x2,…,xn)=(x1,(x2,…,xn)) .[15] This affects the statements of some of his definitions, axioms, and theorems. This article uses Mendelson's definition.[16]
4. ↑ Bernays' class existence axioms specify unique classes. Gödel weakened all but three of Bernays' axioms (intersection, complement, domain) by replacing biconditionals with implications, which means they specify only the ordered pairs or the 3-tuples of the class. The axioms in this section are Gödel's except for Bernays' stronger product by V axiom, which specifies a unique class of ordered pairs. Bernays' axiom simplifies the proof of the class existence theorem. Gödel's axiom B6 appears as the fourth statement of the tuple lemma. Bernays later realized that one of his axioms is redundant, which implies that one of Gödel's axioms is redundant. Using the other axioms, axiom B6 can be proved from axiom B8, and B8 can be proved from B6, so either axiom can be considered the redundant axiom.[17] The names for the tuple-handling axioms are from the French Wikipédia article: Théorie des ensembles de von Neumann.
5. ↑ 5.0 5.1 This article uses Bourbaki's complement notation ∁(A) and relative complement notation ∁X(A)=∁(A)∩X.[22] This prefix relative complement notation is used by the class existence theorem to mirror the prefix logical not (¬).
6. ↑ Since Gödel states this axiom before he proves the existence of the empty class, he states it without using the empty class.[5]
7. ↑ The proofs in this and the next section come from Gödel's proofs, which he gave at the Institute for Advanced Study where he "could count upon an audience well versed in mathematical logic".[28] To make Gödel's proofs more accessible to Wikipedia readers, a few modifications have been made. The goal in this and the next section is to prove Gödel's M4, his fourth class existence theorem. The proof in this section mostly follows the M1 proof,[29] but it also uses techniques from the M3 and M4 proofs. The theorem is stated with class variables rather than M1's symbols for special classes (universal quantification over the class variables is equivalent to being true for any instantiation of the class variables). The major differences from the M1 proof are: unique classes of n-tuples are generated at the end of the basis and inductive steps (which require Bernays' stronger product by V axiom), and bound variables are replaced by subscripted variables that continue the numbering of the free set variables. Since bound variables are free for part of the induction, this guarantees that, when they are free, they are treated the same as the original free variables. One of the benefits of this proof is the example output of the function Class, which shows that a class's construction mirrors its defining formula's construction.
8. ↑ One detail has been left out of this proof. Gödel's convention is being used, so ∃xϕ(x) is defined to be ∃x[∃C(x∈C)∧ϕ(x)]. Since this formula quantifies over classes, it must be replaced with the equivalent ∃x[x∈V∧ϕ(x)]. Then the three formulas in the proof having the form ∃xn+1[xn+1∧…] become ∃xn+1[xn+1∈V∧…], which produces a valid proof.
9. ↑ Recursive computer programs written in pseudocode have been used elsewhere in pure mathematics. For example, they have been used to prove the Heine-Borel theorem and other theorems of analysis.[31]
10. ↑ This theorem is Gödel's theorem M4. He proved it by first proving M1, a class existence theorem that uses symbols for special classes rather than free class variables. M1 produces a class containing all the n-tuples satisfying ϕ, but which may contain elements that are not n-tuples. Theorem M2 extends this theorem to formulas containing relations, special classes, and operations. Theorem M3 is obtained from M2 by replacing the symbols for special classes with free variables. Gödel used M3 to define A×B={x:∃y∃z[x=(y,z)∧y∈A∧z∈B]}, which is unique by extensionality. He used A×B to define Vn. Theorem M4 is obtained from M3 by intersecting the class produced by M3 with Vn to produce the unique class of n-tuples satisfying the given formula. Gödel's approach, especially his use of M3 to define A×B, eliminates the need for Bernays' stronger form of the product by V axiom.[33]
11. ↑ Gödel weakened Bernays' axioms of union and power set, which state the existence of these sets, to the above axioms that state there is a set containing the union and a set containing the power set.[35] Bernays published his axioms after Gödel, but had sent them to Gödel in 1931.[36]
12. ↑ Since ZFC's axiom requires the existence of the empty set, an advantage of NBG's axiom is that the axiom of the empty set is not needed. Mendelson's axiom system uses the ZFC's axiom of infinity and also has the axiom of the empty set.[37]
13. ↑ For V having a well-ordering implying global choice, see Implications of the axiom of limitation of size. For global choice implying the well-ordering of any class, see Kanamori 2009, p. 53.
14. ↑ In 1917, Dmitry Mirimanoff published a form of replacement based on cardinal equivalence.[41]
15. ↑ 15.0 15.1 In 1928, von Neumann stated: "A treatment of ordinal number closely related to mine was known to Zermelo in 1916, as I learned subsequently from a personal communication. Nevertheless, the fundamental theorem, according to which to each well-ordered set there is a similar ordinal, could not be rigorously proved because the replacement axiom was unknown."[43]
16. ↑ von Neumann 1923. Von Neumann's definition also used the theory of well-ordered sets. Later, his definition was simplified to the current one: An ordinal is a transitive set that is well-ordered by ∈.[44]
17. ↑ After introducing the cumulative hierarchy, von Neumann could show that Zermelo's axioms do not prove the existence of ordinals α ≥ ω + ω, which include uncountably many hereditarily countable sets. This follows from Skolem's result that Vω+ω satisfies Zermelo's axioms[46] and from α ∈ Vβ implying α < β.[47]
18. ↑ Von Neumann stated his axiom in an equivalent functional form.[49]
19. ↑ Skolem's approach implicitly involves natural numbers because the formulas of an axiom schema are built using structural recursion, which is a generalization of mathematical recursion over the natural numbers.
20. ↑ Mirimanoff defined well-founded sets in 1917.[53]
21. ↑ Akihiro Kanamori points out that Bernays lectured on his axiom system in 1929-1930 and states that "… he and Zermelo must have arrived at the idea of incorporating Foundation [regularity] almost at the same time."[55] However, Bernays did not publish the part of his axiom system containing regularity until 1941.[56]
22. ↑ Proof that von Neumann's axiom implies global choice: Let R={(x,y):x≠∅∧y∈x}. Von Neumann's axiom implies there is a function G⊆R such that Dom(G)=Dom(R). The function G is a global choice function since for all nonempty sets x, G(x)∈x.
Proof that global choice implies von Neumann's axiom: Let G be a global choice function, and let R be a relation. For x∈Dom(R), let α(x)=least{α:∃y[(x,y)∈R∩Vα]} where Vα is the set of all sets having rank less than α. Let zx={y:(x,y)∈R∩Vα(x)}. Then F={(x,G(zx)):x∈Dom(R)} is a function that satisfies von Neumann's axiom since F⊆R and Dom(F)=Dom(R).
23. ↑ Gödel used von Neumann's 1929 axioms in his 1938 announcement of his relative consistency theorem and stated "A corresponding theorem holds if T denotes the system of Principia mathematica".[64] His 1939 sketch of his proof is for Zermelo set theory and ZF.[65] Proving a theorem in multiple formal systems was not unusual for Gödel. For example, he proved his incompleteness theorem for the system of Principia mathematica, but pointed out that it "holds for a wide class of formal systems ...".[66]
24. ↑ Gödel's consistency proof builds the constructible universe. To build this in ZF requires some model theory. Gödel built it in NBG without model theory. For Gödel's construction, see Gödel 1940, pp. 35–46 or Cohen 1966, pp. 99–103.
25. ↑ Cohen also gave a detailed proof of Gödel's relative consistency theorems using ZF.[74]
26. ↑ In the 1960s, this conservative extension theorem was proved independently by Paul Cohen, Saul Kripke, and Robert Solovay. In his 1966 book, Cohen mentioned this theorem and stated that its proof requires forcing. It was also proved independently by Ronald Jensen and Ulrich Felgner, who published his proof in 1971.[75]
27. ↑ Both conclusions follow from the conclusion that every proper class can be put into one-to-one correspondence with the class of all ordinals. A proof of this is outlined in Kanamori 2009, p. 53.
28. ↑ Easton built a model of Mendelson's version of NBG in which ZFC's axiom of choice holds but global choice fails.
29. ↑ In the cumulative hierarchy Vκ, the subsets of Vκ are in Vκ+1. The constructible hierarchy Lκ produces subsets more slowly, which is why the subsets of Lκ are in Lκ+ rather than Lκ+1.[80]

## References

1. ↑ 1.0 1.1 von Neumann 1925, pp. 221–224, 226, 229; English translation: van Heijenoort 2002b, pp. 396–398, 400, 403.
2. ↑ 2.0 2.1 2.2 2.3 Bernays 1937, pp. 66-67.
3. ↑ Gödel 1940.
4. ↑ Gödel 1940, pp. 3–7.
5. ↑ 5.0 5.1 5.2 Gödel 1940, p. 6.
6. ↑ Gödel 1940, p. 25.
7. ↑ Gödel 1940, pp. 35–38.
8. ↑ 8.0 8.1 "The Neumann-Bernays-Gödel axioms". Encyclopædia Britannica. https://www.britannica.com/science/set-theory/The-Neumann-Bernays-Godel-axioms. Retrieved 17 January 2019.
9. ↑ 9.0 9.1 Gödel 1940, p. 3.
10. ↑ Mendelson 1997, pp. 225–226.
11. ↑ Bernays 1937, p. 66.
12. ↑ Mendelson 1997, p. 226.
13. ↑ Gödel's axiom A3 (Gödel 1940, p. 3).
14. ↑ Gödel's axiom A4 (Gödel 1940, p. 3).
15. ↑ Gödel 1940, p. 4).
16. ↑ Mendelson 1997, p. 230.
17. ↑ Kanamori 2009, p. 56; Bernays 1937, p. 69; Gödel 1940, pp. 5, 9; Mendelson 1997, p. 231.
18. ↑ Gödel's axiom B1 (Gödel 1940, p. 5).
19. ↑ Gödel's axiom B2 (Gödel 1940, p. 5).
20. ↑ Gödel's axiom B3 (Gödel 1940, p. 5).
21. ↑ Gödel's axiom B4 (Gödel 1940, p. 5).
22. ↑ Bourbaki 2004, p. 71.
23. ↑ Bernays' axiom b(3) (Bernays 1937, p. 5).
24. ↑ Gödel's axiom B7 (Gödel 1940, p. 5).
25. ↑ Gödel's axiom B8 (Gödel 1940, p. 5).
26. ↑ Gödel 1940, p. 6; Kanamori 2012, p. 70.
27. ↑ Kanamori 2009, p. 57; Gödel 2003, p. 121\. Both references contain Gödel's proof but Kanamori's is easier to follow since he uses modern terminology.
28. ↑ Dawson 1997, p. 134.
29. ↑ Gödel 1940, pp. 8–11
30. ↑ Gödel 1940, p. 11.
31. ↑ Gray 1991.
32. ↑ Gödel 1940, pp. 11–13.
33. ↑ Gödel 1940, pp. 8–15.
34. ↑ Gödel 1940, pp. 16–18.
35. ↑ Bernays 1941, p. 2; Gödel 1940, p. 5).
36. ↑ 36.0 36.1 Kanamori 2009, p. 48; Gödel 2003, pp. 104–115.
37. ↑ Mendelson 1997, pp. 228, 239.
38. ↑ Easton 1964, pp. 56a–64.
39. ↑ von Neumann 1925, von Neumann 1928.
40. ↑ Ferreirós 2007, p. 369.
41. ↑ Mirimanoff 1917, p. 49.
42. ↑ Kanamori 2012, p. 62.
43. ↑ Hallett 1984, p. 280.
44. ↑ Kunen 1980, p. 16.
45. ↑ von Neumann 1925, p. 223 (footnote); English translation: van Heijenoort 2002b, p. 398 (footnote).
46. ↑ Kanamori 2012, p. 61
47. ↑ Kunen 1980, pp. 95–96. Uses the notation R(β) instead of Vβ.
48. ↑ Hallett 1984, pp. 288–290.
49. ↑ von Neumann 1925, p. 225; English translation: van Heijenoort 2002b, p. 400.
50. ↑ Fraenkel, Historical Introduction in Bernays 1991, p. 13.
51. ↑ von Neumann 1925, pp. 224–226; English translation: van Heijenoort 2002b, pp. 399–401.
52. ↑ Montague 1961.
53. ↑ Mirimanoff 1917, p. 41.
54. ↑ von Neumann 1925, pp. 230–232; English translation: van Heijenoort 2002b, pp. 404–405.
55. ↑ Kanamori 2009, pp. 53–54.
56. ↑ Bernays 1941, p. 6.
57. ↑ von Neumann 1929, p. 229; Ferreirós 2007, pp. 379–380.
58. ↑ Kanamori 2009, pp. 49, 53.
59. ↑ Kanamori 2009, pp. 48, 58. Bernays' articles are reprinted in Müller 1976, pp. 1–117.
60. ↑ Bernays 1937, p. 65.
61. ↑ Kanamori 2009, pp. 48–54.
62. ↑ Kanamori 2009, p. 56.
63. ↑ Kanamori 2009, pp. 56–58; Gödel 1940, Chapter I: The axioms of abstract set theory, pp. 3–7.
64. ↑ Gödel 1990, p. 26.
65. ↑ Gödel 1990, pp. 28–32.
66. ↑ Gödel 1986, p. 145.
67. ↑ Solovay 1990, p. 13.
68. ↑ Kunen 1980, p. 176.
69. ↑ Gödel 1990, p. 108, footnote i. The paragraph containing this footnote discusses why Gödel considered "property of set" a primitive of set theory and how it fit into his ontology. "Property of set" corresponds to the "class" primitive in NBG.
70. ↑ Kanamori 2009, p. 57.
71. ↑ Cohen 1963.
72. ↑ Kanamori 2009, p. 65: "Forcing itself went a considerable distance in downgrading any formal theory of classes because of the added encumbrance of having to specify the classes of generic extensions."
73. ↑ Cohen 1966, pp. 107–147.
74. ↑ Cohen 1966, pp. 85–99.
75. ↑ Ferreirós 2007, pp. 381–382; Cohen 1966, p. 77; Felgner 1971.
76. ↑ Mostowski 1950, p. 113, footnote 11. Footnote references Wang's NQ set theory, which later evolved into MK.
77. ↑ Kanamori 2009b, pp. 18, 29.
78. ↑ Chuaqui 1981, p. 313 proves that (Vκ, Vκ+1, ∈) is a model of MKTR + AxC. MKT is Tarski's axioms for MK without Choice or Replacement. MKTR + AxC is MKT with Replacement and Choice (Chuaqui 1981, pp. 4, 125), which is equivalent to MK.
79. ↑ Mendelson 1997, p. 275.
80. ↑ Gödel 1940, p. 54; Solovay 1990, pp. 9–11.
81. ↑ Gödel 1940, p. 54.
82. ↑ A. Enayat, "Set theoretical analogues of the Barwise-Schlipf theorem". Annals of Pure and Applied Logic vol. 173 (2022).
83. ↑ Adámek, Herrlich & Strecker 2004, pp. 15–16, 40.

## Bibliography

* Adámek, Jiří; Herrlich, Horst; Strecker, George E. (1990), Abstract and Concrete Categories (The Joy of Cats) (1st ed.), New York: Wiley & Sons, ISBN 978-0-471-60922-3, http://katmat.math.uni-bremen.de/acc/ .
* Adámek, Jiří; Herrlich, Horst; Strecker, George E. (2004), Abstract and Concrete Categories (The Joy of Cats) (Dover ed.), New York: Dover Publications, ISBN 978-0-486-46934-8, http://katmat.math.uni-bremen.de/acc/ .
* Bernays, Paul (1937), "A System of Axiomatic Set Theory—Part I", The Journal of Symbolic Logic 2 (1): 65-77, doi:10.2307/2268862 .
* Bernays, Paul (1941), "A System of Axiomatic Set Theory—Part II", The Journal of Symbolic Logic 6 (1): 1-17, doi:10.2307/2267281 .
* Bernays, Paul (1991), Axiomatic Set Theory (2nd Revised ed.), Dover Publications, ISBN 978-0-486-66637-2 .
* Bourbaki, Nicolas (2004), Elements of Mathematics: Theory of Sets, Springer, ISBN 978-3-540-22525-6, https://archive.org/details/springer_10.1007-978-3-642-59309-3 .
* Chuaqui, Rolando (1981), Axiomatic Set Theory: Impredicative Theories of Classes, North-Holland, ISBN 0-444-86178-5 .
* Cohen, Paul (1963), "The Independence of the Continuum Hypothesis", Proceedings of the National Academy of Sciences of the United States of America 50 (6): 1143–1148, doi:10.1073/pnas.50.6.1143, PMID 16578557, Bibcode: 1963PNAS...50.1143C .
* Cohen, Paul (1966), Set Theory and the Continuum Hypothesis, W. A. Benjamin .
* Cohen, Paul (2008), Set Theory and the Continuum Hypothesis, Dover Publications, ISBN 978-0-486-46921-8, https://books.google.com/books?id=Z4NCAwAAQBAJ .
* Dawson, John W. (1997), Logical dilemmas: The life and work of Kurt Gödel, Wellesley, MA: AK Peters .
* Easton, William B. (1964), Powers of Regular Cardinals, Princeton University .
* Felgner, Ulrich (1971), "Comparison of the axioms of local and universal choice", Fundamenta Mathematicae 71: 43–62, doi:10.4064/fm-71-1-43-62, http://matwbn.icm.edu.pl/ksiazki/fm/fm71/fm7113.pdf .
* Ferreirós, José (2007), Labyrinth of Thought: A History of Set Theory and Its Role in Mathematical Thought (2nd revised ed.), Basel, Switzerland: Birkhäuser, ISBN 978-3-7643-8349-7 .
* Gödel, Kurt (1940), The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory (Revised ed.), Princeton University Press, ISBN 978-0-691-07927-1 .
* Gödel, Kurt (2008), The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory, with a foreword by Laver, Richard (Paperback ed.), Ishi Press, ISBN 978-0-923891-53-4 .
* Gödel, Kurt (1986), Collected Works, Volume 1: Publications 1929-1936, Oxford University Press, ISBN 978-0-19-514720-9 .
* Gödel, Kurt (1990), Collected Works, Volume 2: Publications 1938-1974, Oxford University Press, ISBN 978-0-19-514721-6 .
* Gödel, Kurt (2003), Collected Works, Volume 4: Correspondence A-G, Oxford University Press, ISBN 978-0-19-850073-5 .
* Gray, Robert (1991), "Computer programs and mathematical proofs", The Mathematical Intelligencer 13 (4): 45-48, doi:10.1007/BF03028342 .
* Hallett, Michael (1984), Cantorian Set Theory and Limitation of Size (Hardcover ed.), Oxford: Clarendon Press, ISBN 978-0-19-853179-1 .
* Hallett, Michael (1986), Cantorian Set Theory and Limitation of Size (Paperback ed.), Oxford: Clarendon Press, ISBN 978-0-19-853283-5 .
* Kanamori, Akihiro (2009b), The Higher Infinite: Large Cardinals in Set Theory from Their Beginnings, Springer, ISBN 978-3-540-88867-3 .
* Kanamori, Akihiro (2009), "Bernays and Set Theory", Bulletin of Symbolic Logic 15 (1): 43–69, doi:10.2178/bsl/1231081769, http://math.bu.edu/people/aki/17a.pdf .
* Kanamori, Akihiro (2012), "In Praise of Replacement", Bulletin of Symbolic Logic 18 (1): 46–90, doi:10.2178/bsl/1327328439, http://math.bu.edu/people/aki/20.pdf .
* Kunen, Kenneth (1980), Set Theory: An Introduction to Independence Proofs (Hardcover ed.), North-Holland, ISBN 978-0-444-86839-8 .
* Kunen, Kenneth (2012), Set Theory: An Introduction to Independence Proofs (Paperback ed.), North-Holland, ISBN 978-0-444-56402-3 .
* Mendelson, Elliott (1997), An Introduction to Mathematical Logic (4th ed.), London: Chapman and Hall/CRC, ISBN 978-0-412-80830-2 . - Pp. 225-86 contain the classic textbook treatment of NBG, showing how it does what we expect of set theory, by grounding relations, order theory, ordinal numbers, transfinite numbers, etc.
* Mirimanoff, Dmitry (1917), "Les antinomies de Russell et de Burali-Forti et le problème fondamental de la théorie des ensembles", L'Enseignement Mathématique 19: 37–52 .
* Montague, Richard (1961), "Semantic Closure and Non-Finite Axiomatizability I", in Buss, Samuel R., Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics, Pergamon Press, pp. 45-69 .
* Mostowski, Andrzej (1950), "Some impredicative definitions in the axiomatic set theory", Fundamenta Mathematicae 37: 111–124, doi:10.4064/fm-37-1-111-124, http://matwbn.icm.edu.pl/ksiazki/fm/fm37/fm37110.pdf .
* Muller, F. A. (1 September 2001), "Sets, classes, and categories", British Journal for the Philosophy of Science 52 (3): 539–73, doi:10.1093/bjps/52.3.539, http://philsci-archive.pitt.edu/1372/1/SetClassCat.PDF .
* Müller, Gurt, ed. (1976), Sets and Classes: On the Work of Paul Bernays, Studies in Logic and the Foundations of Mathematics Volume 84, Amsterdam: North Holland, ISBN 978-0-7204-2284-9 .
* Potter, Michael (2004), Set Theory and Its Philosophy: A Critical Introduction (Hardcover ed.), Oxford University Press, ISBN 978-0-19-926973-0 .
* Potter, Michael (2004p), Set Theory and Its Philosophy: A Critical Introduction (Paperback ed.), Oxford University Press, ISBN 978-0-19-927041-5 .
* Pudlák, Pavel (1998), "The Lengths of Proofs", in Buss, Samuel R., Handbook of Proof Theory, Elsevier, pp. 547-637, ISBN 978-0-444-89840-1, http://users.math.cas.cz/~pudlak/length.pdf .
* Smullyan, Raymond M.; Fitting, Melvin (2010), Set Theory and the Continuum Problem, Dover, ISBN 978-0-486-47484-7 .
* Solovay, Robert M. (1990), "Introductory note to 1938, 1939, 1939a and 1940", Kurt Gödel Collected Works, Volume 2: Publications 1938-1974, Oxford University Press, pp. 1-25, ISBN 978-0-19-514721-6 .
* von Neumann, John (1923), "Zur Einführung der transfiniten Zahlen", Acta Litt. Acad. Sc. Szeged X. 1: 199–208, http://bbi-math.narod.ru/newmann/newmann.html .
* English translation: van Heijenoort, Jean (2002a), "On the introduction of transfinite numbers", From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 (Fourth Printing ed.), Harvard University Press, pp. 346–354, ISBN 978-0-674-32449-7, https://books.google.com/books?id=v4tBTBlU05sC&pg=PA346 .
* English translation: van Heijenoort, Jean (2002b), "An axiomatization of set theory", From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 (Fourth Printing ed.), Harvard University Press, pp. 393–413, ISBN 978-0-674-32449-7, https://books.google.com/books?id=v4tBTBlU05sC&pg=PA393 .
* von Neumann, John (1925), "Eine Axiomatisierung der Mengenlehre", Journal für die Reine und Angewandte Mathematik 154: 219–240, http://gdz.sub.uni-goettingen.de/dms/load/img/?PPN=PPN243919689_0154&DMDID=DMDLOG_0025 .
* von Neumann, John (1928), "Die Axiomatisierung der Mengenlehre", Mathematische Zeitschrift 27: 669–752, doi:10.1007/bf01171122, http://gdz.sub.uni-goettingen.de/dms/load/img/?PPN=PPN266833020_0027&DMDID=DMDLOG_0042 .
* von Neumann, John (1929), "Über eine Widerspruchsfreiheitsfrage in der axiomatischen Mengenlehre", Journal für die Reine und Angewandte Mathematik 160: 227–241, http://gdz.sub.uni-goettingen.de/dms/load/img/?PPN=PPN243919689_0160&DMDID=DMDLOG_0019 .

## External links

* "von Neumann-Bernays-Gödel set theory". http://planetmath.org/?op=getobj&from=objects&id={{{id}}}.
* Szudzik, Matthew. "von Neumann-Bernays-Gödel Set Theory". http://mathworld.wolfram.com/vonNeumann-Bernays-GoedelSetTheory.html.

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Von Neumann–Bernays–Gödel set theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Von_Neumann–Bernays–Gödel_set_theory&oldid=4226141"
*[c.]: circa
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template