CLDS for propositional intuitionistic logic

Krysia Broda, Dov Gabbay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings
EditorsNeil V. Murray
PublisherSpringer Verlag
Number of pages17
ISBN (Print)3540660860, 9783540660866
StatePublished - 1999
Externally publishedYes
EventInternational Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999 - Saratoga Springs, United States
Duration: 7 Jun 199911 Jun 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999
Country/TerritoryUnited States
CitySaratoga Springs

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.


Dive into the research topics of 'CLDS for propositional intuitionistic logic'. Together they form a unique fingerprint.

Cite this