Skip to main content
SpringerLink
Log in

Proving Church’s Thesis

(Abstract)

  • Conference paper
Computer Science – Theory and Applications (CSR 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4649))

Included in the following conference series:

  • 708 Accesses

Abstract

The talk reflects recent joint work with Nachum Dershowitz [4].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Buss, S.R., Kechris, A.A., Pillay, A., Shore, R.A.: Prospects for mathematical logic in the twenty-first century. Bulletin of Symbolic Logic 7(2), 169–196 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Church, A.: An unsolvable problem of elementary number theory. American Journal of Mathematics 58, 345–363 (1936)

    Article  MathSciNet  Google Scholar 

  3. Davis, M.: Why Gödel didn’t have Church’s thesis. Information and Control 54, 3–24 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dershowitz, N., Gurevich, Y.: A natural axiomatization of Church’s thesis (to appear)

    Google Scholar 

  5. Gödel, K.: Kurt Gödel: Collected Works. In: Feferman, S. (ed.) Unpublished essays and lectures, vol. III, p. 168. Oxford University Press, Oxford (1995)

    Google Scholar 

  6. Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1, 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  7. Kleene, S.C.: Introduction to Metamathematics. North Holland, Amsterdam (1952)

    MATH  Google Scholar 

  8. Kolmogorov, A.N.: O ponyatii algoritma (On the concept of algorithm), Uspekhi Matematicheskikh Nauk, vol. 8(4), pp. 175–176 (1953) (in Russian). An English translation is In: Uspensky, V.A., Semenov, A.L.: Algorithms: Main Ideas and Applications, pp. 18–19. Kluwer (1993)

    Google Scholar 

  9. Montague, R.: Towards a general theory of computability. Synthese 12(4), 429–438 (1960)

    Article  MathSciNet  Google Scholar 

  10. Shoenfield, J.R.: Recursion Theory. Lecture Notes in Logic, vol. 1. Springer, New York (1991)

    Google Scholar 

  11. Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. In: Proceedings of the London Mathematical Society, vol. 42, pp. 230–265, 1936–37. Corrections in vol. 43, pp. 544–546 (1937)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research,  

    Yuri Gurevich

Authors
  1. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Volker Diekert Mikhail V. Volkov Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurevich, Y. (2007). Proving Church’s Thesis. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74510-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74509-9

  • Online ISBN: 978-3-540-74510-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation