Lévy hierarchy

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 a similar classification for sentences of the language of arithmetic.

Definitions

In the language of set theory, atomic formulas are of the form x = y or x ∈ y, standing for equality and set membership predicates, respectively.

The first level of the Lévy hierarchy is defined as containing only formulas with no unbounded quantifiers and is denoted by [math]\displaystyle{ \Delta_0=\Sigma_0=\Pi_0 }[/math]. The next levels are given by finding a formula in prenex normal form which is provably equivalent over ZFC, and counting the number of changes of quantifiers:^p. 184

A formula [math]\displaystyle{ A }[/math] is called:

• [math]\displaystyle{ \Sigma_{i+1} }[/math] if [math]\displaystyle{ A }[/math] is equivalent to [math]\displaystyle{ \exists x_1 ... \exists x_n B }[/math] in ZFC, where [math]\displaystyle{ B }[/math] is [math]\displaystyle{ \Pi_i }[/math]
• [math]\displaystyle{ \Pi_{i+1} }[/math] if [math]\displaystyle{ A }[/math] is equivalent to [math]\displaystyle{ \forall x_1 ... \forall x_n B }[/math] in ZFC, where [math]\displaystyle{ B }[/math] is [math]\displaystyle{ \Sigma_i }[/math]
• If a formula has both a [math]\displaystyle{ \Sigma_i }[/math] form and a [math]\displaystyle{ \Pi_i }[/math] form, it is called [math]\displaystyle{ \Delta_i }[/math].

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.

Lévy's original notation was [math]\displaystyle{ \Sigma_i^\mathsf{ZFC} }[/math] (resp. [math]\displaystyle{ \Pi_i^\mathsf{ZFC} }[/math]) due to the provable logical equivalence, strictly speaking the above levels should be referred to as [math]\displaystyle{ \Sigma_i^\mathsf{ZFC} }[/math] (resp. [math]\displaystyle{ \Pi_i^\mathsf{ZFC} }[/math]) to specify the theory in which the equivalence is carried out, however it is usually clear from context.^{pp. 441–442} Pohlers has defined [math]\displaystyle{ \Delta_1 }[/math] in particular semantically, in which a formula is "[math]\displaystyle{ \Delta_1 }[/math] in a structure [math]\displaystyle{ M }[/math]".

The Lévy hierarchy is sometimes defined for other theories S. In this case [math]\displaystyle{ \Sigma_i }[/math] and [math]\displaystyle{ \Pi_i }[/math] by themselves refer only to formulas that start with a sequence of quantifiers with at most i−1 alternations, and [math]\displaystyle{ \Sigma_i^S }[/math] and [math]\displaystyle{ \Pi_i^S }[/math] refer to formulas equivalent to [math]\displaystyle{ \Sigma_i }[/math] and [math]\displaystyle{ \Pi_i }[/math] formulas in the language of the theory S. So strictly speaking the levels [math]\displaystyle{ \Sigma_i }[/math] and [math]\displaystyle{ \Pi_i }[/math] of the Lévy hierarchy for ZFC defined above should be denoted by [math]\displaystyle{ \Sigma^{ZFC} _i }[/math] and [math]\displaystyle{ \Pi^{ZFC}_i }[/math].

Examples

Σ₀=Π₀=Δ₀ formulas and concepts

• x = {y, z}^p. 14
• 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 ω
• x is an ordered pair. The first entry of the ordered pair x is a. The second entry of the ordered pair x is b ^p. 14
• f is a function. x is the domain/range of the function f. y is the value of f on x ^p. 14
• The Cartesian product of two sets.
• x is the union of y
• x is a member of the αth level of Godel's L
• R is a relation with domain/range/field a ^p. 14

Δ₁-formulas and concepts

• x is a well-founded relation on y
• x is finite ^p.15
• Ordinal addition and multiplication and exponentiation
• The rank (with respect to Gödel's constructible universe) of a set ^p. 61
• The transitive closure of a set.

Σ₁-formulas and concepts

• x is countable.
• |X|≤|Y|, |X|=|Y|.
• x is constructible.
• g is the restriction of the function f to a ^p. 23
• g is the image of f on a ^p. 23
• b is the successor ordinal of a ^p. 23
• rank(x) ^p. 29
• The Mostowski collapse of [math]\displaystyle{ (x,\in) }[/math] ^p. 29

Π₁-formulas and concepts

• 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

Δ₂-formulas and concepts

• κ is γ-supercompact

Σ₂-formulas and concepts

• the continuum hypothesis
• there exists an inaccessible cardinal
• there exists a measurable cardinal
• κ is an n-huge cardinal

Π₂-formulas and concepts

• The axiom of choice
• The generalized continuum hypothesis
• The axiom of constructibility: V = L

Σ₃-formulas and concepts

• there exists a supercompact cardinal

Π₃-formulas and concepts

• κ is an extendible cardinal

Σ₄-formulas and concepts

• there exists an extendible cardinal

Properties

Let [math]\displaystyle{ n\geq 1 }[/math]. The Lévy hierarchy has the following properties:^p. 184

• If [math]\displaystyle{ \phi }[/math] is [math]\displaystyle{ \Sigma_n }[/math], then [math]\displaystyle{ \lnot\phi }[/math] is [math]\displaystyle{ \Pi_n }[/math].
• If [math]\displaystyle{ \phi }[/math] is [math]\displaystyle{ \Pi_n }[/math], then [math]\displaystyle{ \lnot\phi }[/math] is [math]\displaystyle{ \Sigma_n }[/math].
• If [math]\displaystyle{ \phi }[/math] and [math]\displaystyle{ \psi }[/math] are [math]\displaystyle{ \Sigma_n }[/math], then [math]\displaystyle{ \exists x\phi }[/math], [math]\displaystyle{ \phi\land\psi }[/math], [math]\displaystyle{ \phi\lor\psi }[/math], [math]\displaystyle{ \exists(x\in z)\phi }[/math], and [math]\displaystyle{ \forall(x\in z)\phi }[/math] are all [math]\displaystyle{ \Sigma_n }[/math].
• If [math]\displaystyle{ \phi }[/math] and [math]\displaystyle{ \psi }[/math] are [math]\displaystyle{ \Pi_n }[/math], then [math]\displaystyle{ \forall x\phi }[/math], [math]\displaystyle{ \phi\land\psi }[/math], [math]\displaystyle{ \phi\lor\psi }[/math], [math]\displaystyle{ \exists(x\in z)\phi }[/math], and [math]\displaystyle{ \forall(x\in z)\phi }[/math] are all [math]\displaystyle{ \Pi_n }[/math].
• If [math]\displaystyle{ \phi }[/math] is [math]\displaystyle{ \Sigma_n }[/math] and [math]\displaystyle{ \psi }[/math] is [math]\displaystyle{ \Pi_n }[/math], then [math]\displaystyle{ \phi\implies\psi }[/math] is [math]\displaystyle{ \Pi_n }[/math].
• If [math]\displaystyle{ \phi }[/math] is [math]\displaystyle{ \Pi_n }[/math] and [math]\displaystyle{ \psi }[/math] is [math]\displaystyle{ \Sigma_n }[/math], then [math]\displaystyle{ \phi\implies\psi }[/math] is [math]\displaystyle{ \Sigma_n }[/math].

Devlin p. 29

See also

• Arithmetic hierarchy
• Absoluteness

References

• Devlin, Keith J. (1984). Constructibility. Perspectives in Mathematical Logic. Berlin: Springer-Verlag. pp. 27–30. https://archive.org/details/constructibility00devl_407. 
• Jech, Thomas (2003). Set Theory. Springer Monographs in Mathematics (Third Millennium ed.). Berlin, New York: Springer-Verlag. p. 183. ISBN 978-3-540-44085-7. 
• Kanamori, Akihiro (2006). "Levy and set theory". Annals of Pure and Applied Logic 140 (1–3): 233–252. doi:10.1016/j.apal.2005.09.009. 
• Levy, Azriel (1965). A hierarchy of formulas in set theory. Mem. Am. Math. Soc.. 57.