Cambridge, England: Cambridge University Press (1974)

Authors
John Burgess
Princeton University
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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.
Keywords abacus computable functions
Categories (categorize this paper)
Reprint years 2005, 2007, 2008, 2012
Buy this book $4.99 used   $9.99 new   $19.76 from Amazon    Amazon page
ISBN(s) 0521389232   0511804075   9780511804076   9780511074950   9780521701464   0521809754   9780511364297   0521007585   0521877520   0521701465   9781107049277
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: 68,908
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

Making AI Meaningful Again.Jobst Landgrebe & Barry Smith - 2021 - Synthese 198 (March):2061-2081.
Software Intensive Science.John Symons & Jack Horner - 2014 - Philosophy and Technology 27 (3):461-477.
Chance Versus Randomness.Antony Eagle - 2010 - Stanford Encyclopedia of Philosophy.

View all 45 citations / Add more citations

Similar books and articles

Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
What is Mathematical Logic?John Newsome Crossley (ed.) - 1972 - London and New York: Dover Publications.
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.
Proofs and Computations.Helmut Schwichtenberg - 2011 - Cambridge University Press.
Arithmetic Proof and Open Sentences.Neil Thompson - 2012 - Philosophy Study 2 (1):43-50.
An Introduction to Gödel's Theorems.Peter Smith - 2007 - Cambridge University Press.

Analytics

Added to PP index
2016-02-04

Total views
5 ( #1,198,334 of 2,497,739 )

Recent downloads (6 months)
3 ( #212,462 of 2,497,739 )

How can I increase my downloads?

Downloads

My notes