Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-fqc5m Total loading time: 0 Render date: 2024-03-29T08:03:36.035Z Has data issue: false hasContentIssue false

Trees and degrees

from PART VI - RECURSION THEORY

Published online by Cambridge University Press:  05 December 2015

Piergiorgio Odifreddi
Affiliation:
UNIVERSITY OF CALIFORNIA LOS ANGELES
Alexander S. Kechris
Affiliation:
California Institute of Technology
Benedikt Löwe
Affiliation:
Universiteit van Amsterdam
John R. Steel
Affiliation:
University of California, Berkeley
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Ordinal Definability and Recursion Theory
The Cabal Seminar, Volume III
, pp. 424 - 457
Publisher: Cambridge University Press
Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[Coo73] S. Barry, CooperMinimal degrees and the jump operator, The Journal of Symbolic Logic, vol. 38 (1973), pp. 249–271.Google Scholar
[Eps75] Richard L., EpsteinMinimal degrees of unsolvability and the full approximation construction, vol. 3, Memoirs of the American Mathematical Society, no. 162, American Mathematical Society, 1975.Google Scholar
[Eps79] Richard L., EpsteinDegrees of unsolvability: Structure and theory, Lecture Notes, vol. 759, Springer, 1979.Google Scholar
[Hug69] D. F., HugillInitial segments of Turing degrees, Proceedings of the London Mathematical Society. Third Series, vol. 19 (1969), pp. 1–16.Google Scholar
[Joc69A] Carl G., JockuschThe degrees of bi-immune sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 (1969), pp. 135–140.Google Scholar
[Joc69B] Carl G., JockuschRelationships betwewen reducibilities, Transactions of the American Mathematical Society, vol. 142 (1969), pp. 229–237.Google Scholar
[Joc72] Carl G., JockuschRamsey's theorem and recursion theory, The Journal of Symbolic Logic, vol. 37 (1972), pp. 268–280.Google Scholar
[Joc77] Carl G., JockuschSimple proofs of some theorems on high degrees, Canadian Journal of Mathematics, vol. 29 (1977), pp. 1072–1080.Google Scholar
[JP78] Carl G., Jockusch and David B., PosnerDouble jumps of minimal degrees, The Journal of Symbolic Logic, vol. 43 (1978), pp. 715–724.Google Scholar
[JP81] Carl G., Jockusch and David B., PosnerAutomorphism bases for the degrees of unsolvability, Israel Journal of Mathematics, vol. 40 (1981), no. 2, pp. 150–164.Google Scholar
[JS75] Carl G., Jockusch and Stephen G., SimpsonA degree-theoretic definition of the ramified analytic hierarchy, Annals of Mathematical Logic, vol. 10 (1975), pp. 1–32.Google Scholar
[JS72A] Carl G., Jockusch and Robert I., SoareDegrees of members of π01 classes, Pacific Journal of Mathematics, vol. 40 (1972), pp. 605–616.Google Scholar
[JS72B] Carl G., Jockusch and Robert I., Soareπ01 classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar
[KP54] Stephen C., Kleene and Emil L., PostThe upper-semilattice of degrees of recursive unsolvability, Annals of Mathematics, vol. 59 (1954), pp. 379–407.Google Scholar
[Lac68] Alistair H., LachlanDistributive initial segments of the degrees of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 457–472.Google Scholar
[Lac71] Alistair H., LachlanSolution to a problem of Spector, Canadian Journal of Mathematics, vol. 23 (1971), pp. 247–256.Google Scholar
[LL76] Alistair H., Lachlan and R., LebeufCountable initial segments of the degrees of unsolvability, The Journal of Symbolic Logic, vol. 41 (1976), no. 2, pp. 289–300.Google Scholar
[Lad73] Richard E., LadnerA completely mitotic non recursive r.e. set, Transactions of the American Mathematical Society, vol. 184 (1973), pp. 479–507.Google Scholar
[Ler69] Manuel, LermanSome non distributive lattices as initial segments of the degrees of unsolvability, The Journal of Symbolic Logic, vol. 34 (1969), pp. 85–98.Google Scholar
[Ler71] Manuel, LermanInitial segments of the degrees of unsolvability, Annals of Mathematics, vol. 93 (1971), pp. 365–389.Google Scholar
[Man71] Alfred B., ManasterSome contrasts between degrees and the arithmetical hierarchy, The Journal of Symbolic Logic, vol. 36 (1971), pp. 301–304.Google Scholar
[MM68] Donald A., Martin and Webb, MillerThe degrees of hyperimmune sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 159–166.Google Scholar
[NS80B] Anil, Nerode and Richard A., ShoreSecond order logic and first order theories of reducibility orderings, The Kleene Symposium (Proc. Sympos., Univ. Wisconsin, Madison, Wis., 1978) (Amsterdam) (Jon, Barwise, Kenneth, Kunen, and H. J., Keisler, editors), Studies in Logic and the Foundations of Mathematics, vol. 101, North-Holland, 1980, pp. 181–200.
[Odi89] Piergiorgio, OdifreddiClassical recursion theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, 1989.Google Scholar
[Pos44] Emil L., PostRecursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.Google Scholar
[Rog67] Hartley, RogersThe theory of recursive functions and effective computability, McGraw-Hill, 1967.Google Scholar
[Sac61] Gerald E., SacksA minimal degree less than 0′, Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419.Google Scholar
[Sac63] Gerald E., SacksDegrees of unsolvability, Annals of Mathematics Studies, vol. 55, Princeton University Press, 1963.Google Scholar
[Sac71] Gerald E., SacksForcing with perfect closed sets, Axiomatic set theory (Dana S., Scott, editor), Proceedings of Symposia in Pure Mathematics, vol. XIII, Part I, American Mathematical Society, 1971, pp. 331–355.Google Scholar
[Sas74] Leonard P., SassoA minimal degree not realizing the least possible jump, The Journal of Symbolic Logic, vol. 39 (1974), pp. 571–573.Google Scholar
[Sho66] Joseph R., ShoenfieldA theorem on minimal degrees, The Journal of Symbolic Logic, vol. 31 (1966), pp. 539–544.Google Scholar
[Spe71] Ernst, SpeckerRamsey's theorem does not hold in recursive set theory, Logic Colloquium ’69, North Holland, 1971, pp. 439–442.Google Scholar
[Spe56] Clifford, SpectorOn degrees of recursive unsolvability, Annals of Mathematics, vol. 65 (1956), pp. 581–592.Google Scholar
[Tit65] Dieter, TitgemeyerUntersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der rekursiven Unlösbarkeit, Archiv für mathematische Logik und Grundlagenforschung, vol. 8 (1965), pp. 45–62.Google Scholar
[Tra70] B. A., TrahtenbrotOn autoreducibility, Soviet Mathematics, vol. 11 (1970), pp. 814–817, translated from Doklady Akademii Nauk SSSR, vol. 192 (1970), pp. 1224–1227.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×