Simulating non-prenex cuts in quantified propositional calculus

DOI10.1002/malq.201020093zbMath1255.03051OpenAlexW2067703954MaRDI QIDQ3096088

No author found.

Publication date: 7 November 2011

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201020093

zbMATH Keywords

proof complexityprenex cutsquantified propositional calculus

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Complexity of proofs (03F20)

Related Items (1)

Induction rules in bounded arithmetic

Cites Work

• On induction-free provability
• Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
• Quantified propositional calculi and fragments of bounded arithmetic
• Logical Foundations of Proof Complexity

This page was built for publication: Simulating non-prenex cuts in quantified propositional calculus