Goal-Directed Proof Theory

  • Dov M. Gabbay
  • Nicola Olivetti

Part of the Applied Logic Series book series (APLS, volume 21)

Table of contents

  1. Front Matter
    Pages i-x
  2. Dov M. Gabbay, Nicola Olivetti
    Pages 1-19
  3. Dov M. Gabbay, Nicola Olivetti
    Pages 21-91
  4. Dov M. Gabbay, Nicola Olivetti
    Pages 93-115
  5. Dov M. Gabbay, Nicola Olivetti
    Pages 117-169
  6. Dov M. Gabbay, Nicola Olivetti
    Pages 171-248
  7. Dov M. Gabbay, Nicola Olivetti
    Pages 249-254
  8. Back Matter
    Pages 255-268

About this book


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

Authors and affiliations

  • Dov M. Gabbay
    • 1
  • Nicola Olivetti
    • 2
  1. 1.Department of Computer ScienceKing’s CollegeLondonUK
  2. 2.Universitá di TorinoTorinoItaly

Bibliographic information

  • DOI
  • Copyright Information Springer Science+Business Media B.V. 2000
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-90-481-5526-2
  • Online ISBN 978-94-017-1713-7
  • Series Print ISSN 1386-2790
  • Buy this book on publisher's site