Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
CLDS for Propositional Intuitionistic Logic
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Decidable CLDS for Some Propositional Resource Logics
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
CLDS for Propositional Intuitionistic Logic
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
The compilation approach for Labelled Deductive Systems (CLDS) is used to obtain a decidable theorem prover for propositional intuitionistic logic. Previous applications of the CLDS method were based around a natural deduction system, together with the notion of a theory as a structure of points, called a configuration, and a semantic approach using a translation technique based on first-order logic. In this paper the same semantic method is used, but the proof system is instead a first order theorem prover using techniques drawn from the Davis Putnam and Hyper-resolution procedures. This is shown to be sound and complete with respect to the semantics. The resulting system is a generalisation of intuitionistic logic in a sense that is explained and it is briefly compared with other first order translation techniques.