• List Price: CDN$ 39.95
  • You Save: CDN$ 3.53 (9%)
Only 5 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Computability and Logic has been added to your Cart
+ CDN$ 6.49 shipping
Used: Very Good | Details
Sold by AMMBooksUK
Condition: Used: Very Good
Comment: Unread. There is some shelfwear. In stock ready to dispatch from the UK by air mail.
Have one to sell?
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 – Jul 28 2010

See all 3 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"
"Please retry"
CDN$ 36.42
CDN$ 36.41 CDN$ 29.20

Harry Potter Coloring Book Deal
click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
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.

Product Details

  • Paperback: 366 pages
  • Publisher: Cambridge University Press; 5 edition (Sept. 17 2007)
  • Language: English
  • ISBN-10: 0521701465
  • ISBN-13: 978-0521701464
  • Product Dimensions: 15.6 x 1.9 x 23.4 cm
  • Shipping Weight: 567 g
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: #189,492 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

Product Description


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

See all Product Description

Customer Reviews

There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: HASH(0xa353881c) out of 5 stars 7 reviews
33 of 35 people found the following review helpful
HASH(0xa3553420) out of 5 stars Could be much better March 21 2009
By Pedestrian - Published on Amazon.com
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.
10 of 10 people found the following review helpful
HASH(0xa3553474) out of 5 stars Pretty good intermediate textbook on logic and topics in the foundations of mathematics. Oct. 13 2010
By NC - Published on Amazon.com
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.
14 of 16 people found the following review helpful
HASH(0xa35538ac) out of 5 stars Very good textbook Oct. 10 2009
By Richard G. Heck - Published on Amazon.com
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.
5 of 6 people found the following review helpful
HASH(0xa3553c60) out of 5 stars Worked for class Feb. 25 2010
By Rare Reviewer - Published on Amazon.com
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.
2 of 3 people found the following review helpful
HASH(0xa3553c0c) out of 5 stars Brilliant and Authoritative March 2 2013
By Herbert Gintis - Published on Amazon.com
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.