Abstract
This little gem is stated unbilled and proved (completely) in the last two lines of \(\S\)2 of the short note Kleene (1938).
Part of an expository article in preparation, written to commemorate the passage of 100 years since the birth of Stephen Cole Kleene.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Addison, J.W.: On some points of the theory of recursive functions. Ph.D. Thesis, University of Wisconsin (1954)
Addison, J.W.: Separation principles in the hierarchies of classical and effective descriptive set theory. Fundamenta Methematicae 46, 123–135 (1959)
Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and logic. Cambridge University Press, Cambridge (1974)
Ceitin, G.: Algorithmic operators in constructive metric spaces. Trudy Mat. Inst. Steklov. 67, 295–361 (1962)
Davis, M.: Relatively recursive functions and the extended Kleene hierarchy. In: Proceedings of the International Congress of Mathematicians, Cambridge, Mass, p. 723 (1950)
Friedberg, R.M.: Un contre-example relatif aux fonctionnelles récursives. Comptes Rendus Acad. Sci. Paris 247, 852–854 (1958)
Kleene, S.C.: General recursive functions of natural numbers. Mathematische Annalen 112, 727–742 (1935)
Kleene, S.C.: On notation for ordinal numbers. Journal of Symbolic Logic 3, 150–155 (1938)
Kleene, S.C.: Recursive predicates and quantifiers. Transactions of the American Mathematical Society 53, 41–73 (1943)
Kleene, S.C.: On the form of predicates in the theory of constructive ordinals. American Journal of Mathematics 66, 41–58 (1944)
Kleene, S.C.: Introduction to metamathematics. D. Van Nostrand Co. / North Holland Co. (1952)
Kleene, S.C.: Arithmetical predicates and function quantifiers. Transactions of the American Mathematical Society 79, 312–340 (1955)
Kleene, S.C.: On the form of predicates in the theory of constructive ordinals (second paper). American Journal of Mathematics 77, 405–428 (1955)
Kleene, S.C.: Hierarchies of number theoretic predicates. Bulletin of the American Mathematical Society 61, 193–213 (1955)
Kleene, S.C.: Quantification of number-theoretic functions. Compositio Mathematica 14, 23–40 (1959)
Kreisel, G., Lacombe, D., Shoenfield, J.R.: Partial recursive functionals and effective operations. In: Heyting, A. (ed.) Constructivity in mathematics: proceedings of the colloquium held in Amsterdam, 1957, pp. 195–207. North Holland Publishing Co., Amsterdam (1957)
Markwald, W.: Zur Theorie der konstruktiven Wohlordnungen. Mathematischen Annalen 127, 135–149 (1954)
Martin, D.A., Steel, J.R.: Projective determinacy. Proceedings of the National Academy of Sciences, USA 85, 6582–6586 (1988)
Moschovakis, Y.N.: Determinacy and prewellorderings of the continuum. In: Bar-Hillel, Y. (ed.) Mathematical Logic and Foundations of Set Theory, pp. 24–62. North-Holland, Amsterdam (1970)
Moschovakis, Y.N.: Descriptive set theory. Mathematical Surveys and Monographs, vol. 155. American Mathematical Society, Providence (2009)
Moschovakis, Y.N.: Classical descriptive set theory as a refinement of effective descriptive set theory (to appear, 2010)
Mostowski, A.: On definable sets of positive integers. Fundamenta Methematicae 34, 81–112 (1946)
Mostowski, A.: A classification of logical systems. Studia Philosophica 4, 237–274 (1951)
Myhill, J.: Creative sets. Zeitschrifft für Mathematische Logik und Grundlagen der Mathematik 1, 97–108 (1955)
Myhill, J., Shepherdson, J.C.: Effective operations on partial recursive functions. Zeitschrifft für Mathematische Logik und Grundlagen der Mathematik 1, 310–317 (1955)
Post, E.L.: Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society 50, 284–316 (1944)
Pour-El, M.B., Kripke, S.: Deduction-preserving “recursive isomorphisms” between theories. Fundamenta Mathematicae 61, 141–163 (1967)
Robinson, R.M.: An essentially undecidable axiom system. In: Proceedings of the International Congress of Mathematics, pp. 729–730 (1950)
Rogers Jr., H.: Theory of recursive functions and effective computability. McGraw-Hill, New York (1967)
Solovay, R.M.: Provability interpretations of modal logic. Israel Journal of Mathematics 25, 287–304 (1976)
Spector, C.: Recursive wellorderings. Journal of Symbolic Logic 20, 151–163 (1955)
Suslin, M.: Sur une definition des ensembles measurables B sans nombres transfinis. Comptes Rendus Acad. Sci. Paris 164, 88–91 (1917)
Woodin, W.H.: Supercompact cardinals, sets of reals, and weakly homogeneous trees. Proceedings of the National Academy of Sciences, USA 85, 6587–6591 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moschovakis, Y.N. (2009). Kleene’s Amazing Second Recursion Theorem. In: Grädel, E., Kahle, R. (eds) Computer Science Logic. CSL 2009. Lecture Notes in Computer Science, vol 5771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04027-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-04027-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04026-9
Online ISBN: 978-3-642-04027-6
eBook Packages: Computer ScienceComputer Science (R0)