Computability and Logic
Cambridge University Press (2007)
| Abstract | Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel’s incompleteness theorems, but also a large number of optional topics, from Turing’s theory of computability to Ramsey’s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems | |||||||||
| Keywords | Computable functions Recursive functions Logic, Symbolic and mathematical | |||||||||
| Categories | ||||||||||
| Buy the book | $87.59 direct from Amazon (19% off) Amazon page | |||||||||
| Call number | QA9.59.B66 2007 | |||||||||
| ISBN(s) | 0521809754 9780521877527 0521877520 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesCarlos Augusto Priscdio (2002). Review: Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics ; Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding. [REVIEW] Bulletin of Symbolic Logic 8 (1):101-104.
Carlos Augusto Priscdio (2002). Review: Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics ; Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding. [REVIEW] Bulletin of Symbolic Logic 8 (1):101-104.
Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.
Martin Davis (ed.) (1965/2004). The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication.
Daniel E. Cohen (1987). Computability and Logic. Halsted Press.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads62 ( #15,152 of 549,267 )Recent downloads (6 months)1 ( #63,397 of 549,267 )How can I increase my downloads? |
My notes
Discussion
