How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning

DOI10.1016/j.entcs.2015.06.004zbMath1352.03067WikidataQ113317782 ScholiaQ113317782MaRDI QIDQ2520659

Edward Hermann Haeusler

Publication date: 16 December 2016

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

zbMATH Keywords

proof theory; natural deduction; minimal propositional logic; propositional logic complexity

Mathematics Subject Classification ID

03B35: Mechanization of proofs and logical operations

03B05: Classical propositional logic

03F20: Complexity of proofs