This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. B. Cooper [1973], Minimal degrees and the jump operator, J. Symb. Logic 38 (1973), 249–271.
R. L. Epstein [1975], Minimal degrees of unsolvability and the full approximation method, Memoirs AMS 162 (1975).
R. L. Epstein [1979], Degrees of unsolvability: Structure and theory, Lecture Notes 759, Springer (1979).
D. F. Hugill [1969], Initial segments of Turing degrees, Proc. London Math. Soc. 19 (1969), 1–16.
C. Jockusch [1969a], Relationships between reducibilities, Trans. AMS 142, (1969), 229–237.
C. Jockusch [1969b], The degrees of bi-immune sets, Zeit. Math. Logic. Grund. Math. 15 (1969), 135–140.
C. Jockusch [1972], Ramsey’s theorem and recursion theory, J. Symb. Logic 37 (1972), 268–280.
C. Jockusch [1977], Simple proofs of some theorems on high degrees, Can. J. Math. 29 (1977), 1072–1080.
C. Jockusch and M. S. Paterson [1976], Completely autoreducible degrees, Zeit. Math. Logic Grund. Math. 22 (1976), 571–575.
C. Jockusch and D. Posner [1978], Double jumps of minimal degrees, J. Symb. Logic 43 (1978), 715–724.
C. Jockusch and D. Posner [198?], Automorphism bases for the degrees of unsolvability, to appear.
C. Jockusch and S. Simpson [1975], A degree-theoretic definition of the ramified analytic hierarchy, Ann. of Math. Logic 10 (1975), 1–32.
C. Jockusch and R. Soare [1972a], Degrees of members of Π 01 classes, Pac. J. Math. 40 (1972), 605–616.
C. Jockusch and R. Soare [1972b], Π 01 classes and degrees of theories, Trans. AMS 173 (1972), 33–56.
S. C. Kleene and E. L. Post [1954], The upper-semilattice of degrees of recursive unsolvability, Ann. of Math. 59 (1954), 379–407.
A. H. Lachlan [1968], Distributive initial segments of the degrees of unsolvability, Zeit. Math. Logic. Grund. Math. 14 (1968), 457–472.
A. H. Lachlan [1971], Solution to a problem of Spector, Can. J. Math. 23 (1971), 247–256.
A. H. Lachlan and R. Lebeuf [1976], Countable initial segments of the degrees of unsolvability, J. Symb. Logic 41 (1976), 289–300.
R. Ladner [1973], A completely mitotic non recursive r.e. set, Trans. AMS 184 (1973), 479–507.
M. Lerman [1969], Some non distributive lattices as initial segments of the degrees of unsolvability, J. Symb. Logic 34 (1969), 85–98.
M. Lerman [1971], Initial segments of the degrees of unsolvability, Ann. of Math. 93 (1971), 365–389.
A. B. Manaster [1971], Some contrasts between degrees and the arithmetical hierarchy, J. Symb. Logic 36 (1971), 301–304.
D. A. Martin and W. Miller [1968], The degrees of hyperimmune sets, Zeit. Math. Logic Grund. Math. 14 (1968), 159–166.
A. Nerode and R. A. Shore [198?], Second order logic and first order theories of reducibility orderings, to appear.
P. G. Odifreddi [198?], Classical recursion theory, to appear.
D. Posner and R. Epstein [1978], Diagonalization in degree constructions, J. Symb. Logic 43 (1978), 280–283.
E. L. Post [1944], Recursively enumerable sets of positive integers and their decision problems, Bull. AMS 50 (1944), 284–316.
H. Rogers, Jr. [1967], The theory of recursive functions and effective computability, McGraw-Hill, 1967.
G. E. Sacks [1961], A minimal degree less than O’, Bull. AMS 67 (1961), 416–419.
G. E. Sacks [1963], Degrees of unsolvability, Ann. Math. Studies n.55, Princeton, 1963.
G. E. Sacks [1971], Forcing with perfect closed sets, Proc. Symp. Pure Math. 13 (1971), 331–355.
L. Sasso [1970], A cornucopia of minimal degrees, J. Symb. Logic. 35 (1970), 383–388.
L. Sasso [1974], A minimal degree not realizing the least possible jump, J. Symb. Logic 39 (1974), 571–573.
J. R. Shoenfield [1966], A theorem on minimal degrees, J. Symb. Logic 31 (1966), 539–544.
E. Specker [1971], Ramsey’s theorem does not hold in recursive set theory, Logic Colloquium ’69, North Holland 1971, 439–442.
C. Spector [1956], On degrees of recursive unsolvability, Ann. of Math. 65 (1956), 581–592.
D. Titgemeyer [1965], Untersuchungen über die struktur des Kleene-Postchen Halbverbandes der Grade der rekursiven Unlösbarkeit, Arch. Math. Logic Grund. 8 (1965), 45–62.
Trathenbrot [1970], On autoreducibility, Sov. Math. Dokl. 11 (1970), 814–817.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Odifreddi, P. (1981). Trees and degrees. In: Kechris, A.S., Martin, D.A., Moschovakis, Y.N. (eds) Cabal Seminar 77 – 79. Lecture Notes in Mathematics, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090244
Download citation
DOI: https://doi.org/10.1007/BFb0090244
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10288-5
Online ISBN: 978-3-540-38422-9
eBook Packages: Springer Book Archive