The Classical Decision Problem and Complexity of the Decision Algorithms

This is the most complete and comprehensive treatment available in book form of the classical decision problem of mathematical logic and its role in modern computer science. A revealing analysis of the natural order of decidable and undecidable cases is given, and of particular interest to the reader will be the complete classification of the solvable and unsolvable standard cases of the classical decision problem, the complexity analysis of the solvable cases, the extremely comprehensive treatment of the reduction method, and the model-theoretic analysis of solvable cases. Many cases are treated here for the first time, and a great number of simple proofs and exercises have been included. The results and methods of the book have been used in logic, computer science & artifical intelligence.