Goodreads helps you keep track of books you want to read.
Start by marking “Computability and Logic” as Want to Read:
Computability and Logic
Enlarge cover
Rate this book
Clear rating
Open Preview

Computability and Logic

4.06  ·  Rating details ·  124 ratings  ·  11 reviews
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 ...more
Paperback, 5th Edition, 350 pages
Published November 29th 2007 by Cambridge University Press (first published January 1st 1980)
More Details... Edit Details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Computability and Logic, please sign up.

Be the first to ask a question about Computability and Logic

Community Reviews

Showing 1-30
Average rating 4.06  · 
Rating details
 ·  124 ratings  ·  11 reviews

More filters
Sort order
Start your review of Computability and Logic
Lane Wilkinson
Jan 05, 2008 rated it did not like it  ·  review of another edition
Shelves: philosophy, logic

This is the classic textbook for anyone who wants to study logic up to and beyond Godel. However, the 4th edition is plagued with serious typographic errors in the exercises. Several proofs are, in fact, impossible. John Burgess has a list of corrections on his website, but it is better just to buy the corrected fifth edition.
Ben Pace
Nov 21, 2013 rated it it was amazing
Jus absolutely delightful. Assumming little background knowledge, it has been incredibly satisfying to be shown how various computational systems work, and then also to show that they're equivalent. Beautiful. Not finished yet.
Jul 14, 2016 rated it it was amazing
Written for an audience with little more background in Math than the absolute basics of Set Theory (probably reading the Enderton book on Set Theory is enough prep for this one, and that's a very light read), it casts a great many interesting theorems in Logic and Computability as so many instances of the non-enumerability of the reals. It's very interesting to see how much is equivalent to that one fact, but I also can't help but feel that some of the proofs could benefit from a different ...more
Mar 02, 2017 rated it it was ok
Ehh. Not the best written book. Some of the proofs could have been better formatted so that it was easier to read and understand. The sentences are long winded and aren't direct enough. Or maybe I'm just very bad at comprehending logic. Hm.

The turing machine chapters are decent. The FOL chapters could have done with some rework. Some of the proofs were blocks of text, and within them they would reference certain stages of the proof, but it wasn't specified which ones, therefore the reader had
Jun 09, 2019 rated it really liked it
Shelves: technical
I read this to get a rough overview over questions of Turing computability. I liked how it‘s written and could follow the proofs okay (I have little background in maths). Caveat though: I quickly lost motivation if the proofs went over multiple pages and skipped them, which hindered my understanding in the later chapters.
Nov 24, 2014 rated it really liked it
You should probably pick up a book on how to effectively, and elegantly, write a proof before reading this.
My mind is full of knowledge.
Warunika Ranaweera
Jun 22, 2013 rated it it was amazing
Simple, yet complete, presentation of the underlying theories of Computability; beautifully explained.
Lane Wilkinson
Jan 05, 2008 rated it it was amazing
Shelves: philosophy, logic
A vast improvement over the fourth edition. Still the best introduction to advanced logic and metatheory.
Chris Rhodes
Dec 06, 2010 rated it really liked it
Shelves: philosophy
Godels incomputability problem. Logic III.
rated it it was amazing
May 26, 2018
Ben Pace
rated it really liked it
Aug 26, 2018
rated it liked it
Mar 15, 2016
Eric Casteleijn
rated it liked it
Jun 27, 2011
rated it really liked it
Sep 18, 2012
rated it it was amazing
Apr 22, 2012
Screw Driver
rated it really liked it
May 01, 2019
Adam Gardner
rated it really liked it
Dec 21, 2007
Alba LG
rated it really liked it
May 22, 2019
rated it it was amazing
Jun 22, 2013
Thomas Schminke
rated it really liked it
Oct 22, 2013
rated it really liked it
May 18, 2012
rated it it was amazing
Nov 30, 2017
Laurie Wilkes
rated it liked it
Mar 12, 2018
Yasser Dawood
rated it really liked it
Feb 08, 2018
Lewis Cawthorne
rated it liked it
Jun 28, 2015
R.P. Shrivastava
rated it it was amazing
Jan 13, 2018
john b. snazelle
rated it it was amazing
Aug 12, 2015
Lucky Bro
rated it it was amazing
Mar 04, 2019
« previous 1 3 4 5 next »
There are no discussion topics on this book yet. Be the first to start one »

Readers also enjoyed

  • Computational Complexity
  • Computational Complexity
  • Algorithm Design
  • On Formally Undecidable Propositions of Principia Mathematica and Related Systems
  • The Frege Reader
  • Wittgenstein on Rules and Private Language: An Elementary Exposition
  • Ontological Relativity and Other Essays
  • The Foundations of Arithmetic: A Logico-Mathematical Enquiry into the Concept of Number
  • How to Solve It: A New Aspect of Mathematical Method
  • Understanding Machine Learning: From Theory to Algorithms
  • Introduction to the Theory of Computation
  • Introduction to Automata Theory, Languages, and Computation
  • The Art of Computer Programming, Volume 1: Fundamental Algorithms
  • Artificial Intelligence: A Modern Approach
  • The Universal Computer: The Road from Leibniz to Turing
  • Discrete Mathematics and Its Applications
  • Computers and Intractability: A Guide to the Theory of NP-Completeness
  • Information Theory, Inference and Learning Algorithms
See similar books…

Goodreads is hiring!

If you like books and love to build cool products, we may be looking for you.
Learn more »