Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus

MaRDI QIDQ2811589zbMATHFDO

Authors Romas Alonderis

Publication date 10 June 2016

Published in Lietuvos Matematikos Rinkinys. Lietuvos Matematiku Draugijos Darbai (Search for Journal in Brave)

zbMATH Keywords

Glivenko theoremclassical propositional sequent calculusintuitionistic propositional sequent calculus

Mathematics Subject Classification ID

Classical propositional logic (03B05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Recommendations

• A proof-search procedure for intuitionistic propositional logic
• Labelled proof systems for intuitionistic provability
• On the intuitionistic force of classical search (extended abstract)
• scientific article; zbMATH DE number 1390270
• scientific article; zbMATH DE number 1753197

Cited in

(8)

• On some non-classical extensions of second-order intuitionistic propositional calculus
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
• A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice
• Propositional intuitionistic multiple-conclusion calculus via proof graphs
• Proof internalization in generalized Frege systems for classical logic
• A proof-search procedure for intuitionistic propositional logic
• Proof-Search in Natural Deduction Calculus for Classical Propositional Logic
• From input/output logics to conditional logics via sequents -- with provers

This page was built for publication: Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus

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