This treatment of the classical decision problem of mathematical logic and its role in modern computer science provides an analysis of the natural order of decidable and undecidable cases. Of particular interest is 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 simple proofs and exercises are included in the book.
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Number of pages: 482
You may also be interested in...
Please sign in to write a review
Simply reserve online and pay at the counter when you collect. Available in shop from just two hours, subject to availability.
Thank you for your reservation
Your order is now being processed and we have sent a confirmation email to you at
When will my order be ready to collect?
Following the initial email, you will be contacted by the shop to confirm that your item is available for collection.
Call us on or send us an email at
Unfortunately there has been a problem with your order
Please try again or alternatively you can contact your chosen shop on or send us an email at