Labelled theorem proving for substructural logics
In this paper we will present an implementation of a theorem prover for substructural logics, as they are presented in the framework of Labelled Deductive Systems . This implementation is an instance of a general theorem proving environment described in .
KeywordsTheorem Proving Automated Reasoning Substructural Logics
Unable to display preview. Download preview PDF.
- 1.Leo Bachmair, H. Gazinger, and U. Waldmann. Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing, 5:193–212, 1994.Google Scholar
- 2.Marcello D'Agostino and Dov M. Gabbay. A generalization of analytic deduction via labelled deductive systems. part I: basic substructural logics. Journal of Automated Reasoning, 13, 1994. To appear.Google Scholar
- 3.Dov Gabbay. Labelled deductive systems — part i. 5th Draft, Dec 1990. To be published by Oxford University Press.Google Scholar
- 4.Claudia Oliveira. An Architecture for Labelled Theorem Proving. PhD thesis, University of London — Imperial College, 1995.Google Scholar