Hyperarithmetical theory explained

In computability theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an important tool in effective descriptive set theory.^[1]

The central focus of hyperarithmetic theory is the sets of natural numbers known as hyperarithmetic sets. There are three equivalent ways of defining this class of sets; the study of the relationships between these different definitions is one motivation for the study of hyperarithmetical theory.

Hyperarithmetical sets and definability

The first definition of the hyperarithmetic sets uses the analytical hierarchy. A set of natural numbers is classified at level

\Sigma ^{1} _{1} of this hierarchy if it is definable by a formula of second-order arithmetic with only existential set quantifiers and no other set quantifiers. A set is classified at level \Pi ^{1} _{1} of the analytical hierarchy if it is definable by a formula of second-order arithmetic with only universal set quantifiers and no other set quantifiers. A set is \Delta ^{1} _{1} if it is both \Sigma ^{1} _{1} and \Pi ^{1} _{1} . The hyperarithmetical sets are exactly the \Delta ^{1} _{1} sets.

Hyperarithmetical sets and iterated Turing jumps: the hyperarithmetical hierarchy

The definition of hyperarithmetical sets as

\Delta ^{1} _{1} does not directly depend on computability results. A second, equivalent, definition shows that the hyperarithmetical sets can be defined using infinitely iterated Turing jumps. This second definition also shows that the hyperarithmetical sets can be classified into a hierarchy extending the arithmetical hierarchy; the hyperarithmetical sets are exactly the sets that are assigned a rank in this hierarchy.

Each level of the hyperarithmetical hierarchy is indexed by a countable ordinal number (ordinal), but not all countable ordinals correspond to a level of the hierarchy. The ordinals used by the hierarchy are those with an ordinal notation, which is a concrete, effective description of the ordinal.

\langle ⋅ , ⋅ \rangle .

• The number 0 is a notation for the ordinal 0.
• If n is a notation for an ordinal λ then

\langle 1 , n \rangle is a notation for λ + 1;

• Suppose that δ is a limit ordinal. A notation for δ is a number of the form

\langle 2 , e\rangle , where e is the index of a total computable function \phi _{e} such that for each n, \phi _{e(n)} is a notation for an ordinal λ_n less than δ and δ is the sup of the set \{ λ _{n} \mid n \in N \} .

This may also be defined by taking effective joins at all levels instead of only notations for limit ordinals.^[2]

There are only countably many ordinal notations, since each notation is a natural number; thus there is a countable ordinal that is the supremum of all ordinals that have a notation. This ordinal is known as the Church–Kleene ordinal and is denoted

\omega ^{CK} _{1} . Note that this ordinal is still countable, the symbol being only an analogy with the first uncountable ordinal, \omega _{1} . The set of all natural numbers that are ordinal notations is denoted l{O} and called Kleene's l{O} .

Ordinal notations are used to define iterated Turing jumps. The sets of natural numbers used to define the hierarchy are

0 ^{(\delta)} for each \delta < \omega ^{CK} _{1} . 0 ^{(\delta)} is sometimes also denoted H(\delta) ,^[3] or H _{e} for a notation e for \delta . Suppose that δ has notation e. These sets were first defined by Davis (1950) and Mostowski (1951). The set 0 ^{(\delta)} is defined using e as follows.

• If δ = 0 then

0 ^{(\delta)} = 0 is the empty set.

• If δ = &lambda; + 1 then

0 ^{(\delta)} is the Turing jump of 0 ^{(λ)} . The sets 0 ^{(1)} and 0 ^{(2)} are 0 ' and 0 '' , respectively.

• If δ is a limit ordinal, let

\langle λ _{n} \mid n \in N \rangle be the sequence of ordinals less than δ given by the notation e. The set 0 ^{(\delta)} is given by the rule 0 ^{(\delta)} = \{ \langle n,i\rangle \mid i \in 0 ^{( λ _{n)}} \} . This is the effective join of the sets 0 ^{( λ _{n)}} .Although the construction of 0 ^{(\delta)} depends on having a fixed notation for δ, and each infinite ordinal has many notations, a theorem of Clifford Spector shows that the Turing degree of 0 ^{(\delta)} depends only on δ, not on the particular notation used, and thus 0 ^{(\delta)} is well defined up to Turing degree.

The hyperarithmetical hierarchy is defined from these iterated Turing jumps. A set X of natural numbers is classified at level δ of the hyperarithmetical hierarchy, for

\delta < \omega ^{CK} _{1} , if X is Turing reducible to 0 ^{(\delta)} . There will always be a least such δ if there is any; it is this least δ that measures the level of uncomputability of X.

Hyperarithmetical sets and constructibility

Let

L _{\alpha} denote the \alpha th level of the constructible hierarchy, and let n: l O\to\omega ^{CK} _{1} be the map from a member of Kleene's O to the ordinal it represents. A subset of N is hyperarithmetical if and only if it is a member of L _{\omega ^{CK} _{1}} . A subset of N is definable by a \Pi ^{1} _{1} formula if and only if its image under n is \Sigma _{1} -definable on L _{\omega ^{CK} _{1}} , where \Sigma _{1} is from the Lévy hierarchy of formulae.^[4]

Hyperarithmetical sets and recursion in higher types

A third characterization of the hyperarithmetical sets, due to Kleene, uses higher-type computable functionals. The type-2 functional

{} ^{2E\colon} N ^{N} \to N is defined by the following rules:{} ^{2E(f)} = 1 if there is an i such that f(i) > 0,{} ^{2E(f)} = 0 if there is no i such that f(i) > 0.Using a precise definition of computability relative to a type-2 functional, Kleene showed that a set of natural numbers is hyperarithmetical if and only if it is computable relative to {} ^{2E} .

Example: the truth set of arithmetic

Every arithmetical set is hyperarithmetical, but there are many other hyperarithmetical sets. One example of a hyperarithmetical, nonarithmetical set is the set T of Gödel numbers of formulas of Peano arithmetic that are true in the standard natural numbers

N . The set T is Turing equivalent to the set 0 ^{(\omega)} , and so is not high in the hyperarithmetical hierarchy, although it is not arithmetically definable by Tarski's indefinability theorem.

Fundamental results

The fundamental results of hyperarithmetic theory show that the three definitions above define the same collection of sets of natural numbers. These equivalences are due to Kleene.

Completeness results are also fundamental to the theory. A set of natural numbers is

\Pi ^{1} _{1} complete if it is at level \Pi ^{1} _{1} of the analytical hierarchy and every \Pi ^{1} _{1} set of natural numbers is many-one reducible to it. The definition of a \Pi ^{1} _{1} complete subset of Baire space (N ^{N} ) is similar. Several sets associated with hyperarithmetic theory are \Pi ^{1} _{1} complete:

• Kleene's

l{O} , the set of natural numbers that are notations for ordinal numbers

• The set of natural numbers e such that the computable function

\phi _{e(x,y)} computes the characteristic function of a well ordering of the natural numbers. These are the indices of recursive ordinals.

• The set of elements of Baire space that are the characteristic functions of a well ordering of the natural numbers (using an effective isomorphism

N ^{N} \cong N ^{N x N} ) .

Results known as

\Sigma ^{1} _{1} bounding follow from these completeness results. For any \Sigma ^{1} _{1} set S of ordinal notations, there is an \alpha < \omega ^{CK} _{1} such that every element of S is a notation for an ordinal less than \alpha . For any \Sigma ^{1} _{1} subset T of Baire space consisting only of characteristic functions of well orderings, there is an \alpha < \omega ^{CK} _{1} such that each ordinal represented in T is less than \alpha .

Relativized hyperarithmeticity and hyperdegrees

The definition of

l{O} can be relativized to a set X of natural numbers: in the definition of an ordinal notation, the clause for limit ordinals is changed so that the computable enumeration of a sequence of ordinal notations is allowed to use X as an oracle. The set of numbers that are ordinal notations relative to X is denoted l{O} ^{X} . The supremum of ordinals represented in l{O} ^{X} is denoted \omega ^{X} _{1} ; this is a countable ordinal no smaller than \omega ^{CK} _{1} .

The definition of

0 ^{(\delta)} can also be relativized to an arbitrary set X of natural numbers. The only change in the definition is that X ^{(0)} is defined to be X rather than the empty set, so that X ^{(1)} = X' is the Turing jump of X, and so on. Rather than terminating at \omega ^{CK} _{1} the hierarchy relative to X runs through all ordinals less than \omega ^{X} _{1} .

The relativized hyperarithmetical hierarchy is used to define hyperarithmetical reducibility. Given sets X and Y, we say

X \leq _{HYP} Y if and only if there is a \delta < \omega ^{Y} _{1} such that X is Turing reducible to Y ^{(\delta)} . If X \leq _{HYP} Y and Y \leq _{HYP} X then the notation X \equiv _{HYP} Y is used to indicate X and Y are hyperarithmetically equivalent. This is a coarser equivalence relation than Turing equivalence; for example, every set of natural numbers is hyperarithmetically equivalent to its Turing jump but not Turing equivalent to its Turing jump. The equivalence classes of hyperarithmetical equivalence are known as hyperdegrees.

The function that takes a set X to

l{O} ^{X} is known as the hyperjump by analogy with the Turing jump. Many properties of the hyperjump and hyperdegrees have been established. In particular, it is known that Post's problem for hyperdegrees has a positive answer: for every set X of natural numbers there is a set Y of natural numbers such that X < _{HYP} Y < _{HYP} l{O} ^{X} .

Generalizations

Hyperarithmetical theory is generalized by α-recursion theory, which is the study of definable subsets of admissible ordinals. Hyperarithmetical theory is the special case in which α is

\omega ^{CK} _{1} .

References

• H. Rogers, Jr., 1967. The Theory of Recursive Functions and Effective Computability, second edition 1987, MIT Press. (paperback),
• G. Sacks, 1990. Higher Recursion Theory, Springer-Verlag.
• S. Simpson, 1999. Subsystems of Second Order Arithmetic, Springer-Verlag.
• C. J. Ash, J. F. Knight, 2000. Computable Structures and the Hyperarithmetical Hierarchy, Elsevier.

External links

• Descriptive set theory. Notes by David Marker, University of Illinois at Chicago. 2002.
• Mathematical Logic II. Notes by Dag Normann, The University of Oslo. 2005.
• Antonio Montalbán: University of California, Berkeley and YouTube content creator

Notes and References

1. https://www.uni-muenster.de/imperia/md/content/logik/Skripte/pohlers._computability_theory_of_hyperarithmetical_sets.pdf Computability Theory of Hyperarithmetical Sets
2. S. G. Simpson, The Hierarchy Based on the Jump Operator, pp.268--269. The Kleene Symposium (North-Holland, 1980)
3. C. J. Ash, J. Knight, Computable Structures and the Hyperarithmetical Hierarchy (Studies in Logic and the Foundation of Mathematics, 2000), ch. 5
4. D. Natingga, Embedding Theorem for the automorphism group of the α-enumeration degrees (p.27), PhD thesis, University of Leeds, 2019.