Analytical Hierarchy

The analytical hierarchy extends the arithmetical hierarchy from first-order to second-order arithmetic, classifying sets of natural numbers by the complexity of definitions that quantify over both numbers and sets of numbers. Where the arithmetical hierarchy captures what is definable with quantification over individuals, the analytical hierarchy captures what is definable with quantification over collections — a qualitative leap that brings it into contact with descriptive set theory, real analysis, and the foundations of mathematics.

The lowest non-trivial class, \u03a3\u2081\u00b9, already contains problems far beyond any finite level of the arithmetical hierarchy, including the set of true sentences of second-order arithmetic and the isomorphism types of countable structures. The projective hierarchy of descriptive set theory is the relativization of the analytical hierarchy to specific models of set theory, linking definability with the geometry of the continuum.

The analytical hierarchy is the arithmetical hierarchy's nightmare: the moment you allow quantification over infinite sets, the discrete ladder dissolves into a landscape whose complexity dwarfs anything reachable by finite alternation. It is the formal demonstration that the step from the finite to the infinite is not quantitative but categorical.