This book offers a comprehensive treatment of the classical decision problem of mathematical logic and of the role of the classical decision problem in modern computer science. The text presents a revealing analysis of the natural order of decidable and undecidable cases and includes a number of simple proofs and exercises.
This book is addressed to all those - logicians, computer scientists, mathe? maticians, philosophers of science as well as the students in all these disci? plines - who may be interested in the development and current status of one of the major themes of mathematical logic in the twentieth century, namely the classical decision problem known also as Hilbert's Entscheidungsproblem. The text provides a comprehensive modern treatment of the subject, includ? ing complexity theoretic analysis. We have made an effort to combine the features of a research monograph and a textbook. Only the basic knowledge of the language of first-order logic is required for understanding of the main parts of the book, and we use standard terminology. The chapters are written in such a way that various combinations of them can be used for introductory or advanced courses on undecidability, decidability and complexity of logical decision problems. This explains a few intended redundancies and repetitions in some of the chapters. The annotated bibliography, the historical remarks at the end of the chap? ters and the index allow the reader to use the text also for quick reference purposes.1. Introduction: The Classical Decision Problem.- 1.1 The Original Problem.- 1.2 The Transformation of the Classical Decision Problem.- 1.3 What Is and What Isnt in this Book.- I. Undecidable Classes.- 2. Reductions.- 2.1 Undecidability and Conservative Reduction.- 2.1.1 The Church-Turing Theorem and Reduction Classes.- 2.1.2 Trakhtenbrots Theorem and Conservative Reductions.- 2.1.3 Inseparability and Model Complexity.- 2.2 Logic and Complexity.- 2.2.1 Propositional SatlÓ»