Goal-directed proof theory

Boston: Kluwer Academic. Edited by Nicola Olivetti (2000)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 86,656

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

14 (#813,940)

6 months
2 (#530,064)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dov Gabbay
Hebrew University of Jerusalem

Citations of this work

Socratic proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.
Context-dependent Abduction and Relevance.Dov Gabbay, Rolf Nossum & John Woods - 2006 - Journal of Philosophical Logic 35 (1):65-81.
Theorem proving for conditional logics: CondLean and GOALDUCK.Nicola Olivetti & Gian Luca Pozzato - 2008 - Journal of Applied Non-Classical Logics 18 (4):427-473.
Nice Embedding in Classical Logic.Peter Verdée & Diderik Batens - 2016 - Studia Logica 104 (1):47-78.

Add more citations

References found in this work

No references found.

Add more references