Goal-Directed Proof Theory

1. Front Matter

   Pages i-x

   PDF

2. Introduction

   • Dov M. Gabbay, Nicola Olivetti

   Pages 1-19

3. Intuitionistic and Classical Logics

   • Dov M. Gabbay, Nicola Olivetti

   Pages 21-91

4. Intermediate Logics

   • Dov M. Gabbay, Nicola Olivetti

   Pages 93-115

5. Modal Logics of Strict Implication

   • Dov M. Gabbay, Nicola Olivetti

   Pages 117-169

6. Substructural Logics

   • Dov M. Gabbay, Nicola Olivetti

   Pages 171-248

7. Conclusions and Further Work

   • Dov M. Gabbay, Nicola Olivetti

   Pages 249-254

8. Back Matter

   Pages 255-268

   PDF

Goal Directed Proof Theory presents a uniform and coherent methodology for automated deduction in non-classical logics, the relevance of which to computer science is now widely acknowledged. The methodology is based on goal-directed provability. It is a generalization of the logic programming style of deduction, and it is particularly favourable for proof search. The methodology is applied for the first time 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 form a procedural perspective.
Readership: Computer scientists, mathematicians and philosophers, and anyone interested in the automation of reasoning based on non-classical logics. The book is suitable for self study, its only prerequisite being some elementary knowledge of logic and proof theory.

• automated deduction
• logic
• modal logic
• proof
• proof theory

• Department of Computer Science, King’s College, London, UK

  Dov M. Gabbay

• Universitá di Torino, Torino, Italy

  Nicola Olivetti

Policies and ethics