Goal-Directed Proof Theory

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

This guide presents a uniform and coherent methodology for automated deduction in non-classical logics, the relevance of which to computer science is widely acknowledged. The methodology is based on goal-directed provability. It is a generalization of the logic programming style of deduction, favourable for proof search. The methodology is applied in a uniform way to a wide range of non-classical systems, covering intuitionistic, intermediate, modal and substructural logics. The book can also be used as an introduction to these logical systems from a procedural perspective. The text should be useful to computer scientists, mathematicians and philosophers, and anyone interested in the automation of reasoning based on non-classical logics. It is also suitable for self study, its only prerequisite being some elementary knowledge of logic and proof theory.