Origins of Recursive Function Theory

Annals of the History of Computing

Volumn 3, Issue 1, 1981, Pages 52-67

  Kleene, Stephen C ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

algorithms; analytic hrerarchy; arithmetical hierarchy; Church's thesis; degrees of unsolvability; finite automata; general recursiveness; hyperanthmetical hierarchy; inductrve definitions; normal form theorem; partial recursiveness; primitive recursiveness; recursion theorem; relative recursiveness; Turing computability; undecidable sentences; definability

Indexed keywords

EID: 0011344497     PISSN: 01641239     EISSN: None     Source Type: Journal    
DOI: 10.1109/MAHC.1981.10004     Document Type: Article

References (93)

1. Ackermann, Wilhelm 1928. Zum Hilbertschen Aufbau der reellen Zahlen. Mathematische Annalen 99, 118–133 (English trans. in van Heijenoort, 1967, pp. 493–507).
2. Addison, John W. 1954. On Some Points of the Theory of Recursive Functions. Ph.D. dissertation, University of Wisconsin.
3. 1955. Analogies in the Borel, Luzin, and Kleene hierarchies, I and II. Abstracts, Bul. Amer. Math. Soc. 61, 75 and 171–172.
4. 1958. Separation principles in the hierarchies of classical and effective descriptive set theory. Fundamenta Mathematicas 46, 123–135.
5. 1960. The theory of hierarchies. Logic, Methodology and Philosophy of Science. Proc. of 1960 International Con gress. E. Nagel, P. Suppes, and A. Tarski, eds. Stanford, Stanford University Press, 1962, pp. 26–37.
6. Axt, Paul 1959. On a subrecursive hierarchy and primitive recursive degrees. Trans. Amer. Math. Soc. 92, 85–105.
7. 1963. Enumeration and the Grzegorczyk hierarchy. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 9, 53–65.
8. Boone, William W. 1968. Decision problems about algebraic and logical systems as a whole and recursively enumerable degrees of unsolvability. Contributions to Mathematical Logic. K. Schütte, ed. Amsterdam, North-Holland, pp. 13–33, 72–74.
9. Brouwer, L. E. J. 1908. De onbetrouwbaarheid der logische principes (The untrustworthiness of the principles of logic). Tijdschrift voor Wijsbegeerte 2, 152–158.
10. 1918–19. Begründung der Mengenlehre unabhängig vom logischen Satz vom ausgeschlossenen Dritten. Verhandelingen der Koninklijke Akademie van Wetenschappen te Amsterdam (Eerste sectie) 12, 5 (1918), 43 pp.; 7 (1919) 33 pp.
11. Church, Alonzo 1932. A set of postulates for the foundation of logic. Annals of Math., 2s. 33, 346–366.
12. 1933. A set of postulates for the foundation of logic (second paper). Annals of Math., 2s. 34, 839–864.
13. 1936. An unsolvable problem of elementary number theory. Amer. J. Math. 58, 345–363.
14. 1936a. A note on the Entscheidungsproblem. J. Symbolic-Logic 1, 40–41. Correction, 101–102.
15. 1938. The constructive second number class. Bul. Amer. Math. Soc. 44. 224–232.
16. Church, Alonzo, and S. C. Kleene 1936. Formal definitions in the theory of ordinal numbers. Fundamenta Mathematicae 28, 11–21.
17. Church, Alonzo, and J. B. Rosser 1936. Some properties of conversion. Trans. Amer. Math. Soc. 39, 472–482.
18. Curry, Haskell B. 1929. An analysis of logical substitution. Amer. J. Math. 51, 363–384.
19. 1930. Grundlagen der kombinatorischen Logik. Amer. J. Math. 52, 509–536, 789–834.
20. 1932. Some additions to the theory of combinators. Amer. J. Math. 54, 551–558.
21. Davis, Martin 1965. The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Hewlett, N.Y., Raven Press, 440 pp.
22. Dedekind, Richard 1888. Was sind und was sollen die Zahlen? Braunschweig (English trans. in Dedekind, Essays on the Theory of Numbers. Chicago, Open Court, 1901, 29–115).
23. Friedberg, Richard M. 1956. [Article concerning him.] Time 67, 12 (March 19, 1956), 83.
24. 1957 (abstract 1956). Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem, 1944). Proc. Nat. Acad. Sci. 43, 236–238. Abstract, Bul. Amer. Math. Soc. 62 (1956), 260.
25. Gödel, Kurt 1931. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik 38, 173–198 (English trans. in Davis, 1965, 4–38, and in van Heijenoort, 1967, 592–616).
26. 1931-32a. [Remarks in] Diskussion zur Grundlegung der Mathematik. Erkenntnis 2, 147–148.
27. 1934. On undecidable propositions of formal mathematical systems. Mimeographed notes by S. C. Kleene and J. B. Rosser on lectures at the Institute for Advanced Study, 1934, 30 pp. (reprinted in Davis, 1965, 39–74).
28. 1938. The consistency of the axiom of choice and of the generalized continuum-hypothesis. Proc. Nat. Acad. Sci. 24, 556–557.
29. 1939. Consistency-proof for the generalized continuum-hypothesis. Proc. Nat. Acad. Sci. 25, 220–224.
30. 1940. The consistency of the axiom of choice and of the generalized continuum-hypothesis with the axioms of set theory. Notes by George W. Brown on lectures at the Institute for Advanced Study, 1938–39. Annals of Mathematics Studies 3, Princeton, Princeton University Press, 66 pp.
31. Hilbert, David 1926. Über das Unendliche. Mathematische Annalen 95, 161–190 (English trans. in van Heijenoort, 1967, 367–392).
32. Kechris, Alexander S., and Yiannis N. Moschovakis 1977. Recursion in higher types. Handbook of Mathematical Logic. Jon Barwise, ed. Amsterdam, North-Holland, pp. 681–737.
33. Kleene, Stephen C. 1934. Proof by cases in formal logic. Annals of Math., 2s. 35, 529–544.
34. 1935. A theory of positive integers in formal logic. Amer. J. Math. 57, 153–173, 219–244.
35. 1936. General recursive functions of natural numbers. Mathematische Annalen 112, 727–742.
36. 1936a. λ-definability and recursiveness. Duke Math. J. 2, 340–353.
37. Kleene, Stephen C. (continued) 1938. On notation for ordinal numbers. J. Symbolic Logic 3. 150–155.
38. 1943. Recursive predicates and quantifiers. Trans. Amer. Math. Soc. 53. 41–73.
39. 1944. On the forms of the predicates in the theory of constructive ordinals. Amer. J. Math. 66, 41–58.
40. 1945. On the interpretation of intuitionistic number theory. J. Symbolic Logic 10, 109–124.
41. 1950. Recursive functions and intuitionistic mathematics. Proc. Int. Congress of Mathematicians, Cambridge, Mass. Providence, Amer. Math. Soc., 1952, I, 679–685. 1952. Introduction to Metamathematics. Amsterdam, North-Holland, xi+550 pp. (eighth reprint 1980).
42. 1955. Arithmetical predicates and function quantifiers. Trans. Amer. Math. Soc. 79, 312–340.
43. 1955a. On the forms of the predicates in the theory of constructive ordinals (second paper). Amer. J. Math. 77, 405–428.
44. 1955b. Hierarchies of number-theoretic predicates. Bul. Amer. Math. Soc. 61, 193–213.
45. 1956. Representation of events in nerve nets and finite automata. Automata Studies. C. E. Shannon and J. McCarthy, eds. Annals of Mathematics Studies 34, 3–41 (slightly altered from Project RAND Research Memorandum RM-704, 15 December 1951, 101 pp.).
46. 1958. Extension of an effectively generated class of functions by enumeration. Colloquium Mathematicum 6, 67–78.
47. 1959. Recursive functionals and quantifiers of finite types I. Trans. Amer. Math. Soc. 91, 1–52.
48. 1962. Lambda-definable functionals of finite types. Fundamenta Mathematicae 50. 281–303.
49. 1963. Recursive functionals and quantifiers of finite types II. Trans. Amer. Math, Soc. 108, 106–142.
50. 1967. Mathematical Logic. New York, John Wiley & Sons, xiii+398 pp.
51. 1973. Realizability: a retrospective survey. Cambridge Summer School in Mathematical Logic, 1971. A. R. D. Mathias and H. Rogers, eds. Lecture Notes in Mathematics 337, Berlin, Springer-Verlag, 95–112.
52. 1976. The work of Kurt Gödel. J. Symbolic Logic 41, 761–778. An addendum, 43 (1978), 613.
53. 1978. Recursive functionals and quantifiers of finite types revisited I. Generalized recursion theory II, Proc. 1977 Oslo Symposium. J. E. Fenstad, R. O. Gandy, and G. Sacks, eds. Amsterdam, North-Holland, 185–222.
54. Kleene, S. C., and Emil L. Post 1954. The upper semi-lattice of degrees of recursive unsolvability. Annals of Math., 2s. 59, 379–407.
55. Kleene, S. C., and J. B. Rosser 1935. The inconsistency of certain formal logics. Annals of Math., 2s. 36, 630–636.
56. Kleene, S. C., and R. E. Vesley 1965. The Foundations of Intuitionistic Mathematics. Amsterdam, North-Holland, viii+206 pp.
57. Markov, A. A. 1947. On the impossibility of certain algorithms in the theory of associative systems (A. A. Markoff). Comptes rendus (Doklady) de l'Académie des Sciences dfi l'URSS, n.s. 55, 583–586 (English trans. of Russian orig inal).
58. 1951. Theory of algorithms. Amer. Math. Soc. Transla lions, 2s. 15 (1960), 1-14 (English trans. of Russian, original).
59. 1954. Theory of Algorithms. National Science Foundation, U.S. Department of Commerce, and Israel Program for Scientific Translation (1961), vi+444 pp. (English trans. of Russian original).
60. McCulloch, Warren S., and Walter Pitts 1943. A logical calculus of the ideas immanent in nervous activity. Bul. Math. Biophysics 5, 115–133.
61. Moschovakis, Yiannis N. 1974. Elementary Induction on Abstract Structures. Amsterdam, North-Holland, 174 pp.
62. Mostowski, Andrzej 1947. On definable sets of positive integers. Fundaments Mathematicae 34, 81–112.
63. 1959. On various degrees of constructivism. Constructivity in Mathematics. Proc. of Colloquium. Amsterdam, 1957, A. Heyting, ed., Amsterdam, North-Holland, 178–194.
64. Muchnik, A. A. 1956. Nerazrešimosf problemy svodimosti teorii algoritmov (Negative answer to the problem of reducibility of the theory of algorithms). Doklady Akademii Nauk, S.S.S.R., n.s. 108, 194–197.
65. 1958. Solution of Post’s reduction problem and some other problems of the theory of algorithms. I. Amer. Math. Soc. Translations, 2s. 29 (1963), 197–215 (English trans. of Russian original).
66. Nelson, David 1947. Recursive functions and intuitionistic number theory. Trans. Amer. Math. Soc. 61, 307–368.
67. Peano, Giuseppe. 1889. Arithmetices Principia. Nova Methodo Exposita. Turin, Bocca, xvi+20 pp. (English trans. in van Heijenoort, 1967, 83–97).
68. 1891. Sul concetto di numéro. Rivista di Matematica 1, 87–102, 256–267.
69. Péter, Rϳzsa 1932. Rekursive Funktionen. Verhandlungen des Internationalen Mathematiker-Kongresses Zürich 2, 336–337.
70. 1934. Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion. Mathematische Annalen 110. 612–632.
71. 1935. Konstruktion nichtrekursiver Funktionen. Mathematische Annalen 111, 42–60.
72. 1936. Über die mehrfache Rekursion. Mathematische Annalen 113, 489–527.
73. 1951. Rekursive Funktionen, Budapest, Akadémiai Kiado (Akademischer Verlag), 206 pp. Recursive Functions, Third revised edition, New York, Academic Press, 1967, 300 pp.
74. Post, Emil L. 1936. Finite combinatory processes—formulation 1. J. Symbolic Logic 1, 103–105.
75. 1943. Formal reductions of the general combinatorial decision problem. Amer. J. Math. 65, 197–215.
76. 1944. Recursively enumerable sets of positive integers and their decision problems. Bul. Amer. Math. Soc. 50, 284–316.
77. 1947. Recursive unsolvability of a problem of Thue. J. Symbolic Logie 12, 1–11.
78. 1948. Degrees of recursive unsolvability. Abstract (Preliminary report). Bul. Amer. Math. Soc. 54, 641–642.
79. Rosser, J. Barkley 1935. A mathematical logic without variables. Annals of Math., 2s. 36, 127–150; Duke Math. J. 1, 328–355.
80. Russell, Bertrand 1919. Introduction to Mathematical Philosophy. London, Geo. Allen and Unwin; New York, Macmillan, viii+208 pp.
81. Sacks, Gerald E. 1963. Degrees of unsolvability. Annals of Mathematics Studies 55, ix+174 pp.
82. Schonfinkel, Moses 1924. Über die Bausteine der mathematischen Logik. Mathematische Annalen 92, 305–316 (English trans. in van Heijenoort, 1967, 355–366).
83. Shoenfield, Joseph R. 1971. Degrees of Unsolvability. Amsterdam, North-Hol-land, viii+111 pp.
84. Skolem, Thoralf 1923. Begründung der elementaren Arithmetik durch die rekurrierende Denkweise ohne Anwendung scheinbare Veränderlichen mit unendlichem Ausdehnungsbereich. Skrifter utgit av Videskapsselskapet i Kristiania, I. Matematisk-Naturvidenskabelig Klasse 1923 6, 38 pp. (English trans. in van Heijenoort, 1967, 302–333).
85. Smullyan, Raymond M. 1961. Theory of formal systems. Annals of Mathematics Studies 47, xi+142 pp.
86. Spector, Clifford 1955. Recursive well-orderings. J. Sym. Logic 20, 151–163.
87. 1961. Inductively defined sets of natural numbers. Infinitistic methods, Proc. Symposium on Foundations of Mathematics, Warsaw, 1959, Oxford, Pergamon; Warsaw, Państwowe Wydawnictwo Naukowe, pp. 97–102.
88. Turing, Alan M. 1936–37. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math, Soc., 2s. 42, 230–265. A correction, 43 (1937), 544–546.
89. 1937. Computability and ν-definability. J. Symbolic Logic 2, 153–163.
90. 1939. Systems of logic based on ordinals. Proc. London Math. Soc., 2s. 45, 161–228.
91. van Heijenoort, Jean 1967. From Frege to Gödel: a Source Book in Mathematical Logic, 1879–1931. Cambridge, Harvard University Press, xi+660 pp.
92. von Neumann, John 1951. The general and logical theory of automata. Cerebral Mechanisms in Behavior: The Hixon Symposium, September 1948, Pasadena. L. A. Jeffress, ed. New York, John Wiley & Sons, pp. 1–31.
93. Whitehead, Alfred North 1911. An Introduction to Mathematics. London, Williams and Norgate; New York, Henry Holt, vi+256 pp.