The Complexity of Propositional Proofs with the Substitution Rule

DOI10.1093/JIGPAL/JZI021MaRDI QIDQ5697716zbMATH OpenOpenAlexFDO

Authors Alasdair Urquhart

Publication date 18 October 2005

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

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

zbMATH Keywords

Frege systemsproof complexitysubstitution ruletautologies

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• The number of lines in Frege proofs with substitution
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 3313427
• Quantified propositional logic and the number of lines of tree-like proofs
• Proof theory

Cited in

(12)

• The number of lines in Frege proofs with substitution
• Quantified propositional logic and the number of lines of tree-like proofs
• scientific article; zbMATH DE number 5910658 (Why is no real title available?)
• scientific article; zbMATH DE number 1342223 (Why is no real title available?)
• scientific article; zbMATH DE number 1114014 (Why is no real title available?)
• scientific article; zbMATH DE number 1555175 (Why is no real title available?)
• A Logical Autobiography
• Substitution and Propositional Proof Complexity
• Comments on the Contributions
• On non-monotonous properties of some classical and nonclassical propositional proof systems
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• Complexity of deductions in a system of classical propositional calculus

This page was built for publication: The Complexity of Propositional Proofs with the Substitution Rule

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