CLDS for propositional intuitionistic logic

Krysia Broda; Dov Gabbay

doi:10.1007/3-540-48754-9_10

CLDS for propositional intuitionistic logic

Krysia Broda, Dov Gabbay

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings
Editors	Neil V. Murray
Publisher	Springer Verlag
Pages	66-82
Number of pages	17
ISBN (Print)	3540660860, 9783540660866
DOIs	https://doi.org/10.1007/3-540-48754-9_10
State	Published - 1999
Externally published	Yes
Event	International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999 - Saratoga Springs, United States Duration: 7 Jun 1999 → 11 Jun 1999

Publication series

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

Conference

Conference	International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999
Country/Territory	United States
City	Saratoga Springs
Period	7/06/99 → 11/06/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Access to Document

10.1007/3-540-48754-9_10

Cite this

Broda, K., & Gabbay, D. (1999). CLDS for propositional intuitionistic logic. In N. V. Murray (Ed.), Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings (pp. 66-82). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1617). Springer Verlag. https://doi.org/10.1007/3-540-48754-9_10

Broda, Krysia ; Gabbay, Dov. / CLDS for propositional intuitionistic logic. Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings. editor / Neil V. Murray. Springer Verlag, 1999. pp. 66-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ff6c4a4c5ded467db237da76843458c6,

title = "CLDS for propositional intuitionistic logic",

abstract = "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.",

author = "Krysia Broda and Dov Gabbay",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999 ; Conference date: 07-06-1999 Through 11-06-1999",

year = "1999",

doi = "10.1007/3-540-48754-9_10",

language = "אנגלית",

isbn = "3540660860",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "66--82",

editor = "Murray, {Neil V.}",

booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings",

address = "גרמניה",

}

Broda, K & Gabbay, D 1999, CLDS for propositional intuitionistic logic. in NV Murray (ed.), Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1617, Springer Verlag, pp. 66-82, International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999, Saratoga Springs, United States, 7/06/99. https://doi.org/10.1007/3-540-48754-9_10

CLDS for propositional intuitionistic logic. / Broda, Krysia; Gabbay, Dov.
Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings. ed. / Neil V. Murray. Springer Verlag, 1999. p. 66-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1617).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - CLDS for propositional intuitionistic logic

AU - Broda, Krysia

AU - Gabbay, Dov

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957364531&partnerID=8YFLogxK

U2 - 10.1007/3-540-48754-9_10

DO - 10.1007/3-540-48754-9_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957364531

SN - 3540660860

SN - 9783540660866

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 66

EP - 82

BT - Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings

A2 - Murray, Neil V.

PB - Springer Verlag

T2 - International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999

Y2 - 7 June 1999 through 11 June 1999

ER -

Broda K, Gabbay D. CLDS for propositional intuitionistic logic. In Murray NV, editor, Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1999, Proceedings. Springer Verlag. 1999. p. 66-82. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48754-9_10

CLDS for propositional intuitionistic logic

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this