Computability and Logic

This classic text offers an accessible introduction to logic and computability, covering essential and optional topics for students.

The book Computability and Logic serves as a comprehensive introduction to the field of logic, making it accessible to students who may not have a strong mathematical background. It effectively covers essential topics typically found in an intermediate logic course, including Godel's incompleteness theorems, while also delving into a variety of optional subjects. These additional topics range from Turing's theory of computability to Ramsey's theorem, providing a broad perspective on the interconnectedness of logic and computation.

In its fifth edition, published in 2007, Computability and Logic has been meticulously revised by John Burgess. The updated content includes a selection of exercises at the end of each chapter, tailored to enhance the learning experience. This edition simplifies the treatment of recursive function representability, which has historically posed challenges for students. The inclusion of these exercises aids in reinforcing the concepts presented throughout the text.

Furthermore, this edition is complemented by a dedicated website and an instructor's manual, making it an invaluable resource for both students and educators. The combination of thorough explanations and practical exercises ensures that readers can engage with the material effectively. Overall, Computability and Logic remains a significant contribution to the field, guiding learners through complex ideas with clarity and insight.