Computability and Mathematical Logic (English Version)

Author: George S. Boolos
Publisher:
Publication Date: 2003-06-01
Features: This book is suitable for students majoring in mathematics, computer science, philosophy, and other related fields. It is also highly beneficial for readers conducting research in fields such as artificial intelligence, philosophy, computational theory, discrete structures, and mathematical logic. The book includes exercises at the end of each chapter and has been reorganized and rewritten in certain chapters to make each chapter more independent, enhancing the flexibility of teaching for instructors and expanding the scope of this book's usage. This is a classic textbook on logic, and the fourth edition has been thoroughly revised to improve readability. The book primarily discusses computability theory, fundamental metatheory, and some advanced topics. It is also suitable for students without a mathematical background, as it not only covers basic topics discussed in intermediate-level logic courses, such as G?del's incompleteness theorems, but also includes a wide range of topics from Turing's computability theory to Ramsey's theorem, making it a classic textbook. The book includes exercises at the end of each chapter and has been reorganized and rewritten in certain chapters to make each chapter more independent, enhancing the flexibility of teaching for instructors and expanding the scope of this book's usage. This book is suitable for students majoring in mathematics, computer science, philosophy, and other related fields. It is also highly beneficial for readers conducting research in fields such as artificial intelligence, philosophy, computational theory, discrete structures, and mathematical logic.