On strong normalization in proof-graphs for propositional logic

DOI10.1016/J.ENTCS.2016.06.012zbMath1394.03073OpenAlexW2471400301WikidataQ113317679 ScholiaQ113317679MaRDI QIDQ1744419

Marcela Quispe-Cruz, Edward Hermann Haeusler, L. N. Gordeev

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.06.012

zbMATH Keywords

sequent calculusproof theoryintuitionistic logicproof graphsN-graphsmultiple-conclusion systems

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Related Items (1)

On strong normalization in proof-graphs for propositional logic

Cites Work

• Proof compressions with circuit-structured substitutions
• On strong normalization in proof-graphs for propositional logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On strong normalization in proof-graphs for propositional logic