Computer Science Textbook Series from Abroad - Computability and Mathematical Logic (4th Edition) (4th Edition)

Author:ブルース
Publisher:
Publish Date: 2005-07-01
Features: The book features: · 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 engaged in research in fields such as artificial intelligence, philosophy, computational theory, discrete structures, and mathematical logic, as well as for instructors. This is a classic textbook on logic, 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, as it includes basic topics discussed in intermediate-level logic courses, such as G?del's incompleteness theorems, as well as 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 of each other, increasing the flexibility for instructors and expanding the scope of the book's use.