CLDS for propositional intuitionistic logic

DOI10.1007/3-540-48754-9_10MaRDI QIDQ4263007zbMATH OpenFDO

Authors Krysia Broda, Dov Gabbay

Publication date 22 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48754-9_10

zbMATH Keywords

compiled labelled deductive systemsdecidable theorem proverfirst-order theorem proverpropositional intuitionistic logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Mechanization of proofs and logical operations (03B35)

Recommendations

• Clausal intuitionistic logic I. fixed-point semantics
• scientific article; zbMATH DE number 1390272
• Intuitionistic conditional logics
• A Lindström theorem for intuitionistic propositional logic
• Clausal intuitionistic logic II. tableau proof procedures
• scientific article; zbMATH DE number 218517
• scientific article; zbMATH DE number 1926635
• A new semantics for intuitionistic predicate logic
• Around classical and intuitionistic linear logics
• Clausal logic and logic programming in algebraic domains

Cited in

(4)

• On the system CL12 of computability logic
• Towards CERes in intuitionistic logic
• scientific article; zbMATH DE number 1926635 (Why is no real title available?)
• Logic Programming

This page was built for publication: CLDS for propositional intuitionistic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263007)