The Complexity of Propositional Proofs with the Substitution Rule

DOI10.1093/jigpal/jzi021zbMath1080.03036OpenAlexW2012135231MaRDI QIDQ5697716

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

substitution ruleproof complexitytautologiesFrege systems

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Related Items (3)

A Logical Autobiography ⋮ Substitution and Propositional Proof Complexity ⋮ Comments on the Contributions

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