Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-19T13:11:27.570Z Has data issue: false hasContentIssue false

Recursion theoretic papers. Introduction to Part VI

from PART VI - RECURSION THEORY

Published online by Cambridge University Press:  05 December 2015

Leo A. Harrington
Affiliation:
University of California, Berkeley
Theodore A. Slaman
Affiliation:
University of California, Berkeley
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. 349 - 354
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

[Coo96] S. Barry, CooperA characterisation of the jumps of minimal degrees below 0′, Computability, enumerability, unsolvability, London Mathematical Society Lecture Note Series, vol. 224, Cambridge University Press, Cambridge, 1996, pp. 81–92.Google Scholar
[CLY05] S. Barry, Cooper, Andrew E. M., Lewis, and Yue, YangProperly Σ2 minimal degrees and 0” complementation, Mathematical Logic Quarterly, vol. 51 (2005), no. 3, pp. 274–276.Google Scholar
[GN84] Edward R., Griffor and Dag, NormannEffective cofinalities and admissibility in E-recursion, Fundamenta Mathematicae, vol. 123 (1984), no. 3, pp. 151–161.Google Scholar
[Kec78C] Alexander S., KechrisOn Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 245–277.
[Cabal ii] Alexander S., Kechris, Donald A., Martin, and Yiannis N., MoschovakisCabal seminar 77–79, Lecture Notes in Mathematics, no. 839, Berlin, Springer, 1981.Google Scholar
[Cabal iv] Alexander S., Kechris, Donald A., Martin, and John R., SteelCabal seminar 81–85, Lecture Notes in Mathematics, no. 1333, Berlin, Springer, 1988.Google Scholar
[Cabal i] Alexander S., Kechris and Yiannis N., MoschovakisCabal seminar 76–77, Lecture Notes in Mathematics, no. 689, Berlin, Springer, 1978.Google Scholar
[Kle59B] Stephen C., KleeneRecursive functionals and quantifiers of finite types. I, Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1–52.Google Scholar
[Kle63] Stephen C., KleeneRecursive functionals and quantifiers of finite types. II, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 106–142.Google Scholar
[Kol78A] Phokion G., KolaitisOn recursion in E and semi-Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 209–243.
[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
[Ler83] Manuel, LermanDegrees of unsolvability, Perspectives in Mathematical Logic, Springer-Verlag, 1983.Google Scholar
[MSS11] Andrew, Marks, Theodore A., Slaman, and John R., SteelMartin's conjecture, arithmetic equivalence, and countable Borel equivalence relations, Preprint, 2011.
[Mar81] Donald A., MartinΠ12 monotone inductive definitions, this volume, originally published in Kechris et al. [Cabal ii], pp. 215–233.
[Mos09] Yiannis N., MoschovakisDescriptive set theory, second ed., Mathematical Surveys and Monographs, vol. 155, American Mathematical Society, 2009.Google Scholar
[NS80A] Anil, Nerode and Richard A., ShoreReducibility orderings: theories, definability and automorphisms, Annals of Mathematical Logic, vol. 18 (1980), no. 1, pp. 61–89.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.Google Scholar
[Nor78] Dag, NormannSet recursion, Generalized recursion theory, II (Proc. Second Sympos., Univ. Oslo, Oslo, 1977), Studies in Logic and the Foundations of Mathematics, vol. 94, North-Holland, 1978, pp. 303–320.Google Scholar
[Odi81] Piergiorgio, OdifreddiTrees and degrees, this volume, originally published in Kechris et al. [Cabal ii], pp. 235–271.
[Odi89] Piergiorgio, OdifreddiClassical recursion theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, 1989.Google Scholar
[Odi99] Piergiorgio, OdifreddiClassical recursion theory. Vol. II, Studies in Logic and the Foundations of Mathematics, vol. 143, North-Holland, 1999.Google Scholar
[Sac90] Gerald E., SacksHigher recursion theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1990.Google Scholar
[SS87] Gerald E., Sacks and Theodore A., SlamanInadmissible forcing, Advances in Mathematics, vol. 66 (1987), no. 1, pp. 1–30.Google Scholar
[SS99] Richard A., Shore and Theodore A., SlamanDefining the Turing jump, Mathematical Research Letters, vol. 6 (1999), no. 5–6, pp. 711–722.Google Scholar
[Sim77] Stephen G., SimpsonFirst-order theory of the degrees of recursive unsolvability, Annals of Mathematics, vol. 105 (1977), no. 1, pp. 121–139.Google Scholar
[Sla85] Theodore A., SlamanReflection and forcing in E-recursion theory, Annals of Pure and Applied Logic, vol. 29 (1985), no. 1, pp. 79–106.Google Scholar
[Sla91] Theodore A., SlamanDegree structures, Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990) (Tokyo), Mathematical Society of Japan, 1991, pp. 303–316.Google Scholar
[SS88] Theodore A., Slaman and John R., SteelDefinable functions on degrees, this volume, originally published in Kechris et al. [Cabal iv], pp. 37–55.
[Spe56] Clifford, SpectorOn degrees of recursive unsolvability, Annals of Mathematics, vol. 65 (1956), pp. 581–592.Google Scholar
[Ste82A] John R., SteelA classification of jump operators, The Journal of Symbolic Logic, vol. 47 (1982), no. 2, pp. 347–358.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
×