An answer to an open problem of Urquhart
From MaRDI portal
Publication:1129262
DOI10.1016/S0304-3975(97)00140-0zbMath0901.03038MaRDI QIDQ1129262
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
propositional logic; sequent calculus; proof complexity; Gentzen calculus; polynomial simulation; analytic cut rule; resolution with limited extension
03F05: Cut-elimination and normal-form theorems
03B05: Classical propositional logic
03F20: Complexity of proofs
Related Items
Cites Work