Proof-graphs for minimal implicational logic

MaRDI QIDQ4994969zbMATH OpenFDO

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

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1404.0082, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2013.2

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Recommendations

• On strong normalization in proof-graphs for propositional logic
• scientific article; zbMATH DE number 7599997
• scientific article; zbMATH DE number 1231506
• Exponentially huge natural deduction proofs are redundant: preliminary results on \(M_{\supset}\)
• How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning

Cited in

(10)

• On strong normalization in proof-graphs for propositional logic
• Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs
• How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning
• Proof compression and NP versus PSPACE
• scientific article; zbMATH DE number 1231506 (Why is no real title available?)
• Uniqueness of normal proofs of minimal formulas
• scientific article; zbMATH DE number 7599923 (Why is no real title available?)
• Exponentially huge natural deduction proofs are redundant: preliminary results on \(M_{\supset}\)
• An Analytic Propositional Proof System on Graphs
• The role of structural reasoning in the genesis of graph theory

This page was built for publication: Proof-graphs for minimal implicational logic

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