Computability and Mathematical Logic

Author: (USA)ブルース/ホーサイジョウ
Publisher:
Publish Date: 2005-07-01
Features: This book's features include: · Concisely elaborates on fundamental results in logic, including computability, undecidability, axiomatization, definability, and incompleteness. · Simple and concise writing style. Although many explanations are formalized, they are very clear; modern elegant proofs help readers understand classic theorems, and the text is concise. · It is also highly beneficial for readers conducting research in fields such as artificial intelligence, philosophy, computational theory, discrete structures, and mathematical logic, as well as for instructors. This is a classic logic textbook, and the fourth edition has been thoroughly revised to enhance readability. The book primarily discusses computability theory, fundamental metatheory, and some advanced topics. It is also suitable for students without a mathematical background. Not only does it cover basic topics discussed in medium-depth logic tutorials, such as G?del's incompleteness theorems, but it also explores a wide range of topics from Turing's computability theory to Ramsey's theorem, making it a classic textbook. The book also includes exercises at the end of each chapter and has reorganized and rewritten certain chapters to make them more independent, increasing instructors' flexibility in teaching and expanding the book's scope of use. This book is suitable for students majoring in mathematics, computer science, philosophy, and 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.