Propositional intuitionistic multiple-conclusion calculus via proof graphs

DOI10.1093/JIGPAL/JZY017MaRDI QIDQ5241915zbMATH OpenOpenAlexFDO

Authors Ruan Carvalho, Anjolina de Oliveira, Ruy J. G. B. de Queiroz

Publication date 4 November 2019

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzy017

zbMATH Keywords

intuitionistic logicmultiple-conclusionn-graphsproof graphsproof theory

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Intuitionistic N-graphs
• Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
• A graphical deep inference system for intuitionistic logic
• Natural deduction for bi-intuitionistic logic
• An alternative natural deduction for the intuitionistic propositional logic

Cited in

(7)

• scientific article; zbMATH DE number 1210779 (Why is no real title available?)
• scientific article; zbMATH DE number 638367 (Why is no real title available?)
• scientific article; zbMATH DE number 6970800 (Why is no real title available?)
• scientific article; zbMATH DE number 7599923 (Why is no real title available?)
• An Analytic Propositional Proof System on Graphs
• Intuitionistic N-graphs
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

This page was built for publication: Propositional intuitionistic multiple-conclusion calculus via proof graphs

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