Reflections on church’s thesis

Notre Dame Journal of Formal Logic

Volumn 28, Issue 4, 1987, Pages 490-498

  Kleene, Stephen C ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84972505147     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1093637645     Document Type: Article

References (29)

1. Cantor, Georg, “Uber eine elementare Frage der Mannigfaltigkeitslehre,” Jahres- bericht der Deutschen Mathematiker-Vereinigung, vol. 1 (1891), pp. 75-78.
2. Church, Alonzo, “A set of postulates for the foundation of logic,” Annals of Mathematics, 2s., vol. 33 (1932), pp. 346-366.
3. Church, Alonzo, “A set of postulates for the foundation of logic (second paper),” Annals of Mathematics, 2s., vol. 34 (1933), pp. 839-864.
4. Church, Alonzo, “An unsolvable problem of elementary number theory,” American Journal of Mathematics, vol. 58 (1936), pp. 345-363. Reprinted in [6], pp. 88-107.
5. Church, Alonzo, “A note on the Entscheidungsproblem,” The Journal of Symbolic Logic, vol. 1 (1936), pp. 40-41. Correction, The Journal of Symbolic Logic, vol. 1 (1936), pp. 101-102. Reprinted (incorporating the Correction) in [6], pp. 108-115.
6. Davis, Martin, The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Raven Press, Hewlett, New York, 1965.
7. Davis, Martin, “Why Godel didn’t have Church’s thesis,” Information and Control, vol. 54 (1982), pp. 3-24.
8. Godel, Kurt, “Uber formal unentscheidbare Satze der Principia Mathematica und verwandter Systeme I,” Monatshefte fur Mathematik und Physik, vol. 38 (1931), pp. 173-198. English translation in [6], pp. 4-38.
9. Godel, Kurt, On Undecidable Propositions of Formal Mathematical Systems. Notes by S. C. Kleene and Barkley Rosser on lectures at the Institute for Advanced Study, 1934. Mimeographed, Princeton, New Jersey. Printed, with emendations and a Postscriptum dated June 3, 1964, in [6], pp. 39-74.
10. Hofstadter, Douglas R., Godel, Escher, Bach: An Eternal Golden Braid. Vintage Books Edition, Random House, New York, 1980. Originally published by Basic Books, New York, 1979.
11. Kalmar, Laszlo, “An argument against the plausibility of Church’s thesis,” pp. 72-80 in Constructivity in Mathematics, Proceedings of Colloquium, Amsterdam, 1957, ed. A. Heiting, North-Holland, Amsterdam, 1959.
12. Kleene, Stephen, “A theory of positive integers in formal logic,” American Journal of Mathematics, vol. 57 (1935), pp. 153-173 and 219-244.
13. Kleene, Stephen, “General recursive functions of natural numbers,” Mathematische Annalen, vol. 112 (1936), pp. 727-742. Reprinted with an Erratum, a Simplification and an Addendum in [6], pp. 236-253. In the Addendum, line 5 from below, for “OOT’i (0(b),0(6),j)” read “(£»r, (/, f,y)\ i.e., (Ey)T, (6(q),0(q),y)” and line 2 from below, for “function” read “relation”.
14. Kleene, Stephen, “On notation for ordinal numbers,” The Journal of Symbolic Logic, vol. 3 (1938), pp. 150-155.
15. Kleene, Stephen, “Recursive predicates and quantifiers,” Transactions of the American Mathematical Society, vol. 53 (1943), pp. 41-73. Reprinted with a Correction and an Addendum in [6], pp. 254-287.
16. Kleene, Stephen, “A symmetric form of GodePs theorem,” Koninklijke Neder- landse Akademie van Wetenschappen, Proceedings of the Section of Sciences, vol. 53 (1950), pp. 800-802; also Indagationes Mathematicae, vol. 12 (1950), pp. 244-246.
17. Kleene, Stephen, Introduction to Metamathematics, North-Holland, Amsterdam; P. Noordhoff, Groningen; D. Van Nostrand, New York and Toronto, 1952. Eighth reprint (1980), North-Holland, Amsterdam and New York; Wolters-Noordhoff, Groningen.
18. Kleene, Stephen, “The new logic,” American Scientist, vol. 57 (1969), pp. 333-347.
19. Kleene, Stephen, “Origins of recursive function theory,” Annals of the History of Computing, vol. 3 (1981), pp. 52-67. For six clarifications and corrections, see footnotes 10 and 12 of [7].
20. Kleene, Stephen, “The theory of recursive functions approaching its centennial,” Bulletin of the American Mathematical Society, n.s., vol. 5 (1981), pp. 43-61. In footnote 1, for “Richard A. Shore” read “Robert I. Soare”.
21. Markov, Andrei A., “Theory of algorithms,” American Mathematical Society Translations, 2s., vol. 15 (1960), pp. 1-14. (English translation of Russian original, 1951.)
22. Markov, Andrei A., Theory of Algorithms, National Science Foundation, U.S. Department of Commerce, and Israel Program for Scientific Translation, 1961. (English translation of Russian original, 1954.)
23. Markov, Andrei A. and Nagornyi, Nikolai M., Teorija Algorifmov, Nauka, Moscow, 1984.
24. Peter, Rozza, “Uber den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion,” Mathematische Annalen, vol. 110 (1934), pp. 612-632.
25. Post, Emil, “Formal reductions of the general combinatorial decision problem,” American Journal of Mathematics, vol. 65 (1943), pp. 197-215.
26. Smullyan, Raymond, Theory of Formal Systems. Annals of Mathematics Studies, Number 47, Princeton University Press, Princeton, 1961.
27. Turing, Alan, “On computable numbers, with an application to the Entscheidungs- problem,” Proceedings of the London Mathematical Society, s. 2, vol. 42 (1937), pp. 230-265. A correction, to the preceding, vol. 43, pp. 544-546. Both reprinted in [6], pp. 115-154.
28. Wang, Hao, From Mathematics to Philosophy, Routledge & Kegan Paul, London; Humanities Press, New York, 1974.
29. Webb, Judson C., Mechanism, Mentalism and Metamathematics: An Essay on Finitism. D. Reidel, Dordrecht, Boston, London, 1980.