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 (categorize this paper)
Buy the book $36.75 used (64% off)   $38.80 new (62% off)   $85.83 direct from Amazon (21% off)    Amazon page
Call number QA9.59.B66 2007
ISBN(s) 0521809754   9780521877527   0521877520
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,747
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.

Citations of this work BETA

View all 46 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

78 ( #16,650 of 1,098,844 )

Recent downloads (6 months)

6 ( #43,429 of 1,098,844 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.