Definable degrees and automorphisms of $\mathcal {D}$

Leo Harrington, Richard A. Shore
1981 Bulletin of the American Mathematical Society  
The basic notion of relative computability, i.e. of one function a: N -> N being computable from another 0, defines, in the obvious way, first an equivalence relation a = jS on functions and then a partial ordering <, called Turing reducibility, on the equivalence classes, called Turing degrees. The analysis of the structure V of these degrees has been a central topic in recursion theory beginning with the papers of Post [1944] and Kleene and Post [1954]. We will here deal with a number of
more » ... l or second order questions about V of the sort first raised in Rogers [1967a] and since then reiterated by many others. In particular we will show that many degrees and relations on them are definable purely in terms of the ordering answering some questions from Simpson [1977]. Our results also impose severe limitations on possible automorphisms of P. Indeed every sufficiently large degree is fixed under every automorphism. (This answers questions from Rogers [1967a], Simpson [1977a] and others.) By applying our methods to the principal filters (or cones) of V we can also considerably improve the solution to the homogeneity problem of Rogers [1967] given in Shore [1979] and [1981]. These results are all derived by combining a strengthening of Harrington and Kechris [1975] with the results and methods of Nerode and Shore [1979] and [1980] and Shore [1979], [1981]. As in these latter papers a crucial role is played by the results of Jockusch and Soare [1970] on minimal covers and Lachlan [1968] on initial segments of p. LEMMA 1. If the Turing degree x is not hyperarithmetic and x, 0 < t then there is a degree s such that t is a minimal cover of s and x ^ s. PROOF. Our starting point is the proof of Harrington and Kechris [1975] that every ÏI® set of reals A such that every hyperarithmetic real is recursive in some member of A contains reals of every Turing degree above 0. Let A = {<a 0 , o t , r 0 , T i )\o l is a witness to the fact that every partial II} function has a total extension recursive in a 0 and r x is the Skolem function witnessing that r 0
doi:10.1090/s0273-0979-1981-14871-0 fatcat:oac6v2hkjbe27oygxvbt7cysqi