Newtonpedia ES
Home › Mathematics › Von Neumann–Bernays–Gödel set theory
Mathematics · 1940

Von Neumann–Bernays–Gödel set theory

An axiomatic set theory that takes the notion of class as its basic concept and can be stated with finitely many axioms.

Year
1940
Section
Mathematics

History

Von Neumann-Bernays-Gödel set theory (NBG) is an axiomatic system that underpins much of modern mathematics. Its defining feature is that it starts from the idea of a class, a collection of objects, and reserves the word set for a special kind of class. It also has a practical advantage: it can be stated with a finite list of axioms, unlike Zermelo-Fraenkel set theory (ZF), whose replacement axiom is really a template that stands for infinitely many statements.

Before NBG, set theory dealt only with sets, and very large collections could lead to paradoxes. In 1925 John von Neumann introduced classes into set theory. His first version took function and argument as its primitive ideas, and defined both class and set from them. Paul Bernays later reworked the theory so that class and set were both primitive. Kurt Gödel then simplified it around 1940, using it to show that the axiom of choice and the generalized continuum hypothesis cannot produce a contradiction, provided the underlying theory is itself consistent.

The central idea is straightforward. A set is a class that belongs to some other class. Classes that fail this test are called proper classes. The universal class and the class of all ordinal numbers are examples. If the ordinals formed a set, a contradiction would follow, so they must be a proper class. In this way NBG avoids the classic paradoxes by demanding certain properties only of sets rather than of every class.

A key result is the class existence theorem. It states that for every formula that quantifies only over sets, there is a class made of exactly the sets that satisfy it. The proof uses a handful of class existence axioms, each turning one basic step in building a formula into the corresponding step in building a class. Since every formula is assembled from a few simple parts, finitely many axioms suffice. Gödel also used proper classes to construct the constructible universe, a collection of sets built step by step from earlier ones.

There are several versions of the theory. Bernays used a two-sorted logic, which made his framework more cumbersome. Gödel relied on special predicates to tell classes and sets apart, while Elliott Mendelson simplified matters by treating everything as a class and calling a class a set when it belongs to another class. Morse-Kelley set theory goes further, letting formulas quantify over classes. NBG is a conservative extension of ZFC, meaning it proves no new statements about sets that ZFC could not already prove.

In everyday mathematical research, ZFC remains the more common reference point. Still, NBG offers a compact way to handle collections too large to be sets and a language for stating global principles, such as the axiom of global choice, which is stronger than the axiom of choice in ZFC. Its main influence lies in logic and the foundations of mathematics, where the distinction between classes and sets remains an active subject of study.

Timeline

  • 1925John von Neumann introduces classes into set theory, starting from the notions of function and argument.
  • 1940Kurt Gödel simplifies the theory to prove the relative consistency of the axiom of choice and the generalized continuum hypothesis.
  • Paul Bernays reformulates the theory, taking class and set as primitive notions.
  • Elliott Mendelson modifies Gödel's approach, treating everything as a class and defining set through membership in another class.

Trivia and anecdotes

The class of all ordinals

If the class of all ordinals were a set, it would be an ordinal belonging to itself, which contradicts the definition of an ordinal. That is why it is a proper class.

Capital letters for classes

Gödel proposed a convention in which capital letters stand for classes and lowercase letters for sets, which makes formulas easier to read.

Seven axioms are enough

The proof of the class existence theorem needs only seven class existence axioms, which replace the infinite schema for forming classes.

Other milestones in Mathematics