David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Kluwer Academic (2000)
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.
|Categories||categorize this paper)|
|Buy the book||$158.99 new (28% off) $208.05 direct from Amazon (5% off) $235.09 used Amazon page|
|Call number||QA9.54.G33 2000|
|ISBN(s)||9048155266 0792364732 9780792364733|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Peter Aczel, Harold Simmons & S. S. Wainer (eds.) (1992). Proof Theory: A Selection of Papers From the Leeds Proof Theory Programme, 1990. Cambridge University Press.
Luca Viganò (2000). Labelled Non-Classical Logics. Kluwer Academic Publishers.
Greg Restall (1998). Displaying and Deciding Substructural Logics 1: Logics with Contraposition. [REVIEW] Journal of Philosophical Logic 27 (2):179-216.
Sara Negri (2011). Proof Analysis: A Contribution to Hilbert's Last Problem. Cambridge University Press.
Arnon Avron & Beata Konikowska (2001). Decomposition Proof Systems for Gödel-Dummett Logics. Studia Logica 69 (2):197-219.
Added to index2009-01-28
Total downloads2 ( #345,130 of 1,098,834 )
Recent downloads (6 months)2 ( #174,441 of 1,098,834 )
How can I increase my downloads?