论文信息 - Simulating non-prenex cuts in quantified propositional calculus

Simulating non-prenex cuts in quantified propositional calculus

We show that the quantified propositional proof systems Gi are polynomially equivalent to their restricted versions that require all cut formulas to be prenex Σqi (or prenex Πqi). Previously this was known only for the treelike systems G*i. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Phuong Nguyen | Emil Jerábek

[1] Jan Krajícek,et al. Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.

[2] Jan Krajícek,et al. Quantified propositional calculi and fragments of bounded arithmetic , 1990, Math. Log. Q..

[3] Tsuyoshi Morioka,et al. Logical approaches to the complexity of search problems: : proof complexity, quantified propositional calculus, and bounded arithmetic , 2005 .

[4] Stephen A. Cook,et al. Quantified propositional calculus and a second-order theory for NC1 , 2005, Arch. Math. Log..

[5] S. Cook,et al. Logical Foundations of Proof Complexity: INDEX , 2010 .

[6] Jan Krajícek,et al. On induction-free provability , 2005, Annals of Mathematics and Artificial Intelligence.