Goal-Directed Proof Theory
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...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Dordrecht
Springer Netherlands
2000, 2000
|
| Edition: | 1st ed. 2000 |
| Series: | Applied Logic Series
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 Introduction
- 2 Intuitionistic and Classical Logics
- 3 Intermediate Logics
- 4 Modal Logics of Strict Implication
- 5 Substructural Logics
- 6 Conclusions and Further Work