“Computability and Logic” has become a classic because of its accessibility to students without a mathematical background. It covers not simply the staple topics of an intermediate logic course, such as Godel’s incompleteness theorems, but also many 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 incompleteness theorems.
