Computability and Logic

Ranked #18 in Logical Reasoning, Ranked #19 in Logic

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 exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel... more

Similar Books

If you like Computability and Logic, check out these similar top-rated books:

Learn: What makes Shortform summaries the best in the world?