In set theory and mathematical logic, the Lévy hierarchy, introduced by Azriel Lévy in 1965, is a hierarchy of formulas in the formal language of the Zermelo–Fraenkel set theory, which is typically called just the language of set theory. This is analogous to the arithmetical hierarchy which provides the classifications but for sentences of the language of arithmetic.
In the language of set theory, atomic formulas are of the form x = y or x ∈ y, standing for equality and respectively set membership predicates.
The first level of the Levy hierarchy is defined as containing only formulas with no unbounded quantifiers, and is denoted by
Δ
0
=
Σ
0
=
Π
0
. The next levels are given by finding an equivalent formula in Prenex normal form, and counting the number of changes of quantifiers:
In the theory ZFC, a formula
A
is called:
Σ
i
+
1
if
A
is equivalent to
∃
x
1
.
.
.
∃
x
n
B
in ZFC, where
B
is
Π
i
Π
i
+
1
if
A
is equivalent to
∀
x
1
.
.
.
∀
x
n
B
in ZFC, where
B
is
Σ
i
If a formula is both
Σ
i
and
Π
i
, it is called
Δ
i
. As a formula might have several different equivalent formulas in Prenex normal form, it might belong to several different levels of the hierarchy. In this case, the lowest possible level is the level of the formula.
The Lévy hierarchy is sometimes defined for other theories S. In this case
Σ
i
and
Π
i
by themselves refer only to formulas that start with a sequence of quantifiers with at most i−1 alternations, and
Σ
i
S
and
Π
i
S
refer to formulas equivalent to
Σ
i
and
Π
i
formulas in the theory S. So strictly speaking the levels
Σ
i
and
Π
i
of the Lévy hierarchy for ZFC defined above should be denoted by
Σ
i
Z
F
C
and
Π
i
Z
F
C
.
x = {y, z}
x ⊆ y
x is a transitive set
x is an ordinal, x is a limit ordinal, x is a successor ordinal
x is a finite ordinal
The first countable ordinal ω.
f is a function. The range and domain of a function. The value of a function on a set.
The product of two sets.
The union of a set.
x is a well-founded relation on y
x is finite
Ordinal addition and multiplication and exponentiation
The rank of a set
The transitive closure of a set
x is countable
|X|≤|Y|, |X|=|Y|
x is constructible
x is a cardinal
x is a regular cardinal
x is a limit cardinal
x is an inaccessible cardinal.
x is the powerset of y
κ is γ-supercompact
the Continuum Hypothesis
there exists an inaccessible cardinal
there exists a measurable cardinal
κ is an n-huge cardinal
The axiom of constructibility: V = L
There is a supercompact cardinal
κ is an extendible cardinal
There is a extendible cardinal
Jech p. 184 Devlin p. 29
