Skip to main content Accessibility help
×
Home

Step by Recursive Step: Church's Analysis of Effective Calculability

  • Wilfried Sieg (a1)

Abstract

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was “Church's Thesis” put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ-definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity.

Copyright

References

Hide All
[1] Bernays, Paul, Logical calculus, The Institute for Advanced Studies, Princeton, 19351936, notes by Prof. Bernays with assistance of Mr. F. A. Ficken.
[2] Church, Alonzo, Alternatives to Zermelo's assumption, Transactions of the American Mathematical Society, vol. 29 (1927), pp. 178208, Ph.D. thesis, Princeton.
[3] Church, Alonzo, On the law of the excluded middle, Bulletin of the American Mathematical Society, vol. 34 (1928), pp. 7578.
[4] Church, Alonzo, A set of postulates for the foundation of logic, part I, Annals of Mathematics, vol. 33 (1932), no. 2, pp. 346–66.
[5] Church, Alonzo, A set of postulates for the foundation of logic, part II, Annals of Mathematics, vol. 34 (1933), no. 2, pp. 839–64.
[6] Church, Alonzo, The Richard paradox, American Mathematical Monthly, vol. 41 (1934), pp. 356–61.
[7] Church, Alonzo, A proof of freedom from contradiction, Proceedings of the National Academy of Sciences, vol. 21 (1935), pp. 275–81.
[8] Church, Alonzo, An unsolvable problem of elementary number theory, Bulletin American Mathematical Society, vol. 41 (1935), pp. 332–3.
[9] Church, Alonzo, A note on the Entscheidungsproblem, Journal of Symbolic Logic, vol. 1 (1936), pp. 40–1, Corrections, Journal of Symbolic Logic , vol. 1 (1936), pp. 101–2.
[10] Church, Alonzo, An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58 (1936), pp. 345–63.
[11] Church, Alonzo, Review of [54], Journal of Symbolic Logic, vol. 2 (1937), no. 1, p. 43.
[12] Church, Alonzo, Review of [63], Journal of Symbolic Logic, vol. 2 (1937), no. 1, pp. 42–3.
[13] Church, Alonzo, Introduction to mathematical logic, vol. I, Princeton University Press, Princeton, 1956.
[14] Church, Alonzo and Kleene, Stephen C., Formal definitions in the theory of ordinal numbers, Bulletin of the American Mathematical Society, vol. 41 (1935), p. 627.
[15] Church, Alonzo and Kleene, Stephen C., Formal definitions in the theory of ordinal numbers, Fundamenta Mathematicae, vol. 28 (1936), pp. 1121.
[16] Church, Alonzo and Rosser, J. Barkley, Some properties of conversion, Bulletin of the American Mathematical Society, vol. 41 (1935), p. 332.
[17] Church, Alonzo and Rosser, J. Barkley, Some properties of conversion, Transactions of the American Mathematical Society, vol. 39 (1936), pp. 472–82.
[18] Davis, Martin, The undecidable, Raven Press, Hewlett, New York, 1965.
[19] Davis, Martin, Why Gödel didn't have Church's thesis, Information and Control, vol. 54 (1982), pp. 324.
[20] Davis, Martin, American logic in the 1920s, this Bulletin, vol. 1 (1995), no. 3, pp. 273–8.
[21] Dawson, John W., Logical dilemmas—the life and work of Kurt Gödel, A. K. Peters, Wellesley, 1997.
[22] Dedekind, Richard, Stetigkeit und irrationale Zahlen, Vieweg, Braunschweig, 1872.
[23] Dedekind, Richard, Was sind und was sollen die Zahlen?, Vieweg, Braunschweig, 1888.
[24] Enderton, Herb, In memoriam: Alonzo Church, this Bulletin, vol. 1 (1995), no. 4, pp. 486–88.
[25] Feferman, Solomon, Turing in the land of O(z), The universal Turing machine (Herken, Rolf, editor), Oxford University Press, Oxford, 1988, pp. 113–47.
[26] Gandy, Robin, The confluence of ideas, The universal Turing machine (Herken, Rolf, editor), Oxford University Press, Oxford, 1988, pp. 55111.
[27] Gödel, Kurt, The present situation in the foundations of mathematics, Collected works III, Oxford University Press, Oxford, 1933, pp. 4553.
[28] Gödel, Kurt, On undecidable propositions of formal mathematical systems, Collected works I, Oxford University Press, Oxford, 1934, pp. 346371.
[29] Gödel, Kurt, Review of [5], Collected works I, Oxford University Press, Oxford, 1934, pp. 381–3.
[30] Gödel, Kurt, On the length of proofs, Collected works I, Oxford University Press, Oxford, 1936, pp. 397–9.
[31] Gödel, Kurt, Review of [7], Collected works I, Oxford University Press, Oxford, 1936, pp. 399401.
[32] Gödel, Kurt, Remarks before the Princeton bicentennial conference on problems in mathematics, Collected works II, Oxford University Press, Oxford, 1946, pp. 150–3.
[33] Gödel, Kurt, Collected works I, Oxford University Press, Oxford, 1986.
[34] Gödel, Kurt, Collected works II, Oxford University Press, Oxford, 1990.
[35] Gödel, Kurt, Collected works III, Oxford University Press, Oxford, 1995.
[36] Hilbert, David, Natur und mathematisches Erkennen, 1919, lecture given in the Winter term 1919, the notes were written by Paul Bernays; reprint by the Mathematical Institute of the University Göttingen, 1989.
[37] Hilbert, David and Bernays, Paul, Grundlagen der Mathematik I, Springer-Verlag, Berlin, 1934.
[38] Hilbert, David and Bernays, Paul, Grundlagen der Mathematik II, Springer-Verlag, Berlin, 1939.
[39] Kleene, Stephen C., Proof by cases in formal logic, Annals of Mathematics, vol. 35 (1934), pp. 529–44.
[40] Kleene, Stephen C., General recursive functions of natural numbers, Bulletin of the American MathematicalSociety, vol. 41 (1935), p. 489.
[41] Kleene, Stephen C., λ-definability and recursiveness, Bulletin of the American Mathematical Society, vol. 41 (1935), p. 490.
[42] Kleene, Stephen C., A theory of positive integers in formal logic, American Journal of Mathematics, vol. 57 (1935), pp. 153–73, 219–44, the story behind this paper is described in [47, pp. 57–58]; it was first submitted on October 9, 1933; its revised version was re-submitted on June 13, 1934.
[43] Kleene, Stephen C., General recursive functions of natural numbers, Mathematische Annalen, vol. 112 (1936), pp. 727–42.
[44] Kleene, Stephen C., λ-definability and recursiveness, Duke Mathematics Journal, vol. 2 (1936), pp. 340–53, [40] and [41] are abstracts of these two papers and were received by the American Mathematical Society on 07 1, 1935.
[45] Kleene, Stephen C., A note on recursive functions, Bulletin of the American Mathematical Society, vol. 42 (1936), pp. 544–6.
[46] Kleene, Stephen C., Introduction to metamathematics, Wolters-Noordhoff Publishing, Groningen, 1952.
[47] Kleene, Stephen C., Origins of recursive function theory, Annals of Historical Computing, vol. 3 (1981), no. 1, pp. 5266.
[48] Kleene, Stephen C. and Rosser, J. Barkley, The inconsistency of certain formal logics, Bulletin of the American Mathematical Society, vol. 41 (1935), p. 24, this abstract was received by the American Mathematical Society on 11 16, 1934.
[49] Kleene, Stephen C. and Rosser, J. Barkley, The inconsistency of certain formal logics, Annals of Mathematics, vol. 36 (1935), no. 2, pp. 630–6.
[50] Mendelson, Elliott, Second thoughts about Church's thesis and mathematical proofs, The Journal of Philosophy, vol. 87 (1990), no. 5, pp. 225–33.
[51] Mundici, Daniele and Sieg, Wilfried, Paper machines, Philosophia Mathematica, vol. 3 (1995), pp. 530.
[52] Odifreddi, Piergiorgio, Kreisel's Church, Kreiseliana (Odifreddi, P., editor), A. K. Peters, Wellesley, 1996, pp. 389415.
[53] Pepis, Józef, Ein Verfahren der mathematischen Logik, Journal of Symbolic Logic, vol. 3 (1938), pp. 6176, reviews of some of his papers appeared in the Journal of Symbolic Logic , vol. 2, p. 84; vol. 3, pp. 160–1; vol. 4, p. 93.
[54] Post, Emil, Finite combinatory processes. Formulation I, Journal of Symbolic Logic, vol. 1 (1936), pp. 103–5.
[55] Rosser, J. Barkley, A mathematical logic without variables, Annals of Mathematics, vol. 36 (1935), no. 2, pp. 127–50, also Duke Mathematics Journal , vol. 1, pp. 328–55.
[56] Rosser, J. Barkley, Highlights of the history of the lambda-calculus, Annals of Historical Computing, vol. 6 (1984), no. 4, pp. 337–49.
[57] Shoenfield, Joseph R., Mathematical logic, Addison-Wesley, Reading, Massachusetts, 1967.
[58] Sieg, Wilfried, Mechanical procedures and mathematical experience, Mathematics and mind (George, A., editor), Oxford University Press, Oxford, 1994, pp. 71117.
[59] Sieg, Wilfried, Aspects of mathematical experience, Philosophy of mathematics today (Agazzi, E. and Darvas, G., editors), Kluwer, 1996, pp. 195217.
[60] Sieg, Wilfried and Byrnes, John, K-graph machines: generalizing Turing's machines and arguments, Gödel'96 (Hájek, Petr, editor), Lecture Notes in Logic, vol. 6, Springer-Verlag, 1996, pp. 98119.
[61] Sieg, Wilfried and Byrnes, John, Gödel, Turing, and K-graph machines, to appear in Logic in Florence, 1997.
[62] Soare, Robert, Computability and recursion, this Bulletin, vol. 2 (1996), no. 3, pp. 284321.
[63] Turing, Alan, On comptable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society. Series 2, vol. 42 (1936), pp. 230265.

Step by Recursive Step: Church's Analysis of Effective Calculability

  • Wilfried Sieg (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed