Enter your mobile number below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Computability and Logic 5th Edition

4.3 out of 5 stars 7 customer reviews
ISBN-13: 978-0521701464
ISBN-10: 0521701465
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Trade in your item
Get a $2.50
Gift Card.
Have one to sell? Sell on Amazon
Buy used On clicking this link, a new layer will be open
$22.03 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$28.51 On clicking this link, a new layer will be open
More Buying Choices
30 New from $27.76 32 Used from $12.35
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Up to 50% off select Non-Fiction books
Featured titles are up to 50% off for a limited time. See all titles
$28.51 FREE Shipping. In Stock. Ships from and sold by Amazon.com. Gift-wrap available.
click to open popover

Frequently Bought Together

  • Computability and Logic
  • +
  • Naive Set Theory
Total price: $40.46
Buy the selected items together

Editorial Reviews

Review

"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.
NO_CONTENT_IN_FEATURE

New York Times best sellers
Browse the New York Times best sellers in popular categories like Fiction, Nonfiction, Picture Books and more. See 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: #161,159 in Books (See Top 100 in Books)

Customer Reviews

Top Customer Reviews

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.
3 Comments 33 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
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 10 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
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 14 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
If you want a rigourous and fairly thorough introduction to the ideas of Tarski, Goedel, Skolem, et al., and you never really understood the Loewenheim-Skolem theorem or Tarski theory of truth, this is the book for you.
Do you understand why a logical system that proves its own consistency must be inconsistent? If not, and you think this is an interesting question, this is the book for you.
2 Comments 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Computability and Logic
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: Computability and Logic