In mathematical logic and descriptive set theory, the analytical hierarchy is a second-order analogue of the arithmetical hierarchy.

The standard notation indicates on the one hand the class of formulas that can be expressed as formulas of arbitrary finite length of alternating universal and existential quantifiers for individuals over predicates linked by sentential connectives; and on the other the class of Borel sets.

A formula is a formula of the form , where X is now a predicate and ,
while a set is a set of the form

,

where S is Borel and R is a relation. A set is said to be analytic, and can thus be seen as a projection of a Borel set.

A formula is the negation of a formula,
while a set is the complement of a Borel set. A set is said to be co-analytic.

Generalizing this construction, a formula is a formula of the form where X is a predicate and
and a set is a set of the form

where S is .

A formula is the negation of a formula,
and a set is the complement of a set.

A formula or set is called if it is both and .

We have the strict containments

A set that is in for some n is said to be projective. We may for example define the set of "first projective" subsets of Rⁿ to be the set of all subsets which are projections of Borel subsets of R^{n + 1} ; it will be the set of subsets. Then we may define "second projective" sets as projections of first projective sets or complements thereof, producing the set of asets, and so on. A set is projective, then, if it belongs to some level of this hierarchy.

External link

• PlanetMath page (http://planetmath.org/encyclopedia/AnalyticHierarchy.html)