Computability and Logic and over one million other books are available for Amazon Kindle. Learn more
Buy New
  • List Price: $34.99
  • Save: $4.92 (14%)
FREE Shipping on orders over $35.
In Stock.
Ships from and sold by
Gift-wrap available.
Sell yours for a Gift Card
We'll buy it for $12.86
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Computability and Logic Paperback – September 17, 2007

ISBN-13: 978-0521701464 ISBN-10: 0521701465 Edition: 5th

Buy New
Price: $30.07
27 New from $30.07 15 Used from $25.00
Amazon Price New from Used from
"Please retry"
"Please retry"
$30.07 $25.00
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Frequently Bought Together

Computability and Logic + An Introduction to Gödel's Theorems (Cambridge Introductions to Philosophy)
Price for both: $63.31

Buy the selected items together

Holiday Deals in Books
Holiday Deals in Books
Find deals for every reader in the Holiday Deals in Books store, featuring savings of up to 50% on cookbooks, children's books, literature & fiction, and more.

Product Details

  • Paperback: 366 pages
  • Publisher: Cambridge University Press; 5 edition (September 17, 2007)
  • Language: English
  • ISBN-10: 0521701465
  • ISBN-13: 978-0521701464
  • Product Dimensions: 6.1 x 0.8 x 9.2 inches
  • Shipping Weight: 1.2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.3 out of 5 stars  See all reviews (7 customer reviews)
  • Amazon Best Sellers Rank: #198,920 in Books (See Top 100 in Books)

Editorial Reviews


"John P. Burgess (Princeton U.) and Richard C. Jeffrey continue here in the tradition set by the late Boolos to present the "principal fundamental theoretical results logic" that would necessarily include the work of G<:o>del. For this edition they have revised and simplified their presentation of the representability of recursive functions, rewritten a section on Robinson arithmetic, and reworked exercises. They continue to present material in a two-semester format, the first on computability theory (enumerability, diagonalization, Turing compatibility, uncomputability, abacus computability, recursive functions, recursive sets and relations, equivalent definitions of computability) and basic metalogic (syntax, semantics, the undecidability of first-order logic, models and their existence, proofs and completeness, arithmetization, representability of recursive functions, indefinability, undecidability, incompleteness and the unprobability of inconsistency). They include a slate of nine further topics, including normal forms, second-order logic and Ramsey's theorem."
Book News, Inc.

Book Description

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.

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.3 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

26 of 28 people found the following review helpful By Pedestrian on March 21, 2009
Format: Paperback
This book has so much going for it: eminent authors, great coverage, lots of exercises and it's quite inexpensive for a math book. But it also has some major drawbacks. First of all: the typos. Oh the typos. I've seen reviews for the fourth edition where there were lots of complaints about the typos. This (the fifth edition) may be an improvement but there are still way too many typos. A bigger problem is that the authors don't always make the important conceptual connections between the material explicit - and this may be the result of a book written by committee. To give an example, there is a whole chapter on enumerability with no mention of decidability. When the authors finally introduce decidability sixty pages later it is not clearly compared with enumerability. But these concepts are related in a very simple but important way - something a beginning student would not realize on reading this book. Finally, the authors don't do a good job of presenting the *big picture* in mathematical logic. And without that, it makes the material less interesting and more difficult to learn.
2 Comments Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
10 of 10 people found the following review helpful By Nan Chen on October 13, 2010
Format: Paperback
This is quite good but the book quickly dives into intermediate or advanced topics in mathematical logic, recursion theory (aka computability) and set theory. Many topics are covered (one of the strengths of the book). The exercises are good, interesting, helpful and can be challenging which is why if you're a novice studying logic it's probably better to start off with a more elementary text focusing on 1st order logic deductions and some of the meta-theoretic results (completeness, soundness, etc) before tackling this textbook. The exercises are an improvement in my opinion, from earlier editions of the book. Many of the answers can be found on the website given in the introductory chapter. The errata page is also located there (and there are plenty of errata to be found in this book, unfortunately!). It also seems that many of the chapters could have been combined and given more of a holistic treatment. That would have made many of the topics easier to understand by making the underlying connections between the topics clearer.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
11 of 12 people found the following review helpful By Richard G. Heck on October 10, 2009
Format: Kindle Edition
I grew up with earlier editions of this book and now teach from it. It's an excellent introduction to this material, pitched at just the right level, in my experience, for its intended audience. For students (or people in general) who are extremely sophisticated mathematically, it can sometimes seem a little unrigorous. But for my students, who are mostly philosophers, it manages to convey a sense for what is going on without overdoing it on the detail. This is not to say that it does not get rigorous where necessary. It does. But when that's not critical, it's content to leave things at a more intuitive level.

As far as approach is concerned, the book places recursion theory at the center. The first several chapters introduce the basics of this subject, and only then do the authors turn toward theories of arithmetic and the like. This corresponds to what is probably the dominant way of thinking of Goedel's theorem: that, at its core, it is a theorem in recursion theory.

Other topics are covered along the way, too, of course, and there are several different courses one could teach using this book. The selection of problems is good, too.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
5 of 6 people found the following review helpful By Rare Reviewer on February 25, 2010
Format: Paperback Verified Purchase
My professor uses this book to the last word. It's a good book overall however the content is not exactly easy. I would recommend this for someone who has a little knowledge of the subject. A novice could possibly use it with the help of google.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

What Other Items Do Customers Buy After Viewing This Item?