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 (categorize this paper)
Buy this book $23.00 used (77% off)   $96.62 new (3% off)   Amazon page
Call number QA9.59.B66 2007
ISBN(s) 0521809754   9780521877527   0521877520
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 56,016
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Against Logicist Cognitive Science.Mike Oaksford & Nick Chater - 1991 - Mind and Language 6 (1):1-38.
The Logic and Meaning of Plurals. Part I.Byeong-Uk Yi - 2005 - Journal of Philosophical Logic 34 (5-6):459-506.

View all 90 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
147 ( #64,750 of 2,403,591 )

Recent downloads (6 months)
4 ( #197,288 of 2,403,591 )

How can I increase my downloads?

Downloads

My notes