An answer to an open problem of Urquhart

DOI10.1016/S0304-3975(97)00140-0zbMath0901.03038OpenAlexW2085900785MaRDI QIDQ1129262

Uwe Egly

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00140-0

zbMATH Keywords

propositional logicsequent calculusproof complexityGentzen calculuspolynomial simulationanalytic cut ruleresolution with limited extension

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items

Non-elementary speed-ups in proof length by different variants of classical analytic calculi

Cites Work

• On different structure-preserving translations to normal form
• A structure-preserving clause form translation
• The complexity of Gentzen systems for propositional logic
• The Complexity of Propositional Proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item