In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by V, is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930.
The rank of a well-founded set is defined inductively as the smallest ordinal number greater than the ranks of all members of the set. In particular, the rank of the empty set is zero, and every ordinal has a rank equal to itself. The sets in V are divided into the transfinite hierarchy Vα , called the cumulative hierarchy, based on their rank.
The cumulative hierarchy is a collection of sets Vα
indexed by the class of ordinal numbers; in particular, Vα is the set of all sets having ranks less than α. Thus there is one set Vα for each ordinal number α. Vα may be defined by transfinite recursion as follows:
Let V0 be the empty set:
For any ordinal number β, let Vβ+1 be the power set of Vβ:
For any limit ordinal λ, let Vλ be the union of all the V-stages so far:
A crucial fact about this definition is that there is a single formula φ(α,x) in the language of ZFC that states "the set x is in Vα".
The sets Vα are called stages or ranks.
The class V is defined to be the union of all the V-stages:
An equivalent definition sets
for each ordinal α, where is the powerset of .
The rank of a set S is the smallest α such that Another way to calculate rank is:
The first five von Neumann stages V0 to V4 may be visualized as follows. (An empty box represents the empty set. A box containing only an empty box represents the set containing only the empty set, and so forth.)
This sequence exhibits tetrational growth. The set V5 contains 216 = 65536 elements; the set V6 contains 265536 elements, which very substantially exceeds the number of atoms in the known universe; and for any natural n, the set Vn+1 contains 2 ↑↑ n elements using Knuth's up-arrow notation.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Set Theory as a foundational system for mathematics. ZF, ZFC and ZF with atoms. Relative consistency of the Axiom of Choice, the Continuum Hypothesis, the reals as a countable union of countable sets,
L'objectif de ce cours est d'introduire les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'Informatique et de développer une première compétence en programmation (
In mathematics, the axiom of regularity (also known as the axiom of foundation) is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads: The axiom of regularity together with the axiom of pairing implies that no set is an element of itself, and that there is no infinite sequence (an) such that ai+1 is an element of ai for all i.
In set theory, a branch of mathematics, a set is called transitive if either of the following equivalent conditions hold: whenever , and , then . whenever , and is not an urelement, then is a subset of . Similarly, a class is transitive if every element of is a subset of . Using the definition of ordinal numbers suggested by John von Neumann, ordinal numbers are defined as hereditarily transitive sets: an ordinal number is a transitive set whose members are also transitive (and thus ordinals).
In axiomatic set theory and the branches of mathematics and philosophy that use it, the axiom of infinity is one of the axioms of Zermelo–Fraenkel set theory. It guarantees the existence of at least one infinite set, namely a set containing the natural numbers. It was first published by Ernst Zermelo as part of his set theory in 1908. In the formal language of the Zermelo–Fraenkel axioms, the axiom reads: In words, there is a set I (the set that is postulated to be infinite), such that the empty set is in I, and such that whenever any x is a member of I, the set formed by taking the union of x with its singleton {x} is also a member of I.
In the conventional von Neumann (VN) architecture, data—both operands and operations to be performed on those operands—makes its way from memory to a dedicated central processor. With the end of Dennard scaling and the resulting slowdown in Moore’s law, th ...
We consider nonlinear parabolic stochastic PDEs on a bounded Lipschitz domain driven by a Gaussian noise that is white in time and colored in space, with Dirichlet or Neumann boundary condition. We establish existence, uniqueness and moment bounds of the r ...
Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...