Cutting planes and constant depth Frege proofs

The cutting planes refutation system for propositional logic is an extension of resolution and is based on showing the nonexistence of solutions for families of integer linear inequalities. The author defines a modified system of cutting planes with limited extension and shows that this system can polynomially simulate constant-depth Frege proof systems. The principal tool to establish this result is an effective version of cut elimination for modified cutting planes with limited extension. Thus, within a polynomial factor, one can simulate classical propositional logic proofs using modus ponens by refutation-style proofs, provided the formula depth is bounded by a constant. Propositional versions of the Paris-Harrington theorem, Kanamori-McAloon theorem, and variants are proposed as possible candidates for combinatorial tautologies that may require exponential-size cutting planes and Frege proofs.<<ETX>>

[1]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[2]  Andreas Goerdt.  The Cutting Plane Proof System with Bounded Degree of Falsity , 1991, CSL.

[3]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[4]  John L. Bell,et al.  A course in mathematical logic , 1977 .

[5]  Stephen A. Cook,et al.  Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.

[6]  Jan Krajícek,et al.  Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.

[7]  Kenneth McAloon,et al.  On Gödel incompleteness and finite combinatorics , 1987, Ann. Pure Appl. Log..

[8]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  M. Ajtai.  Parity and the Pigeonhole Principle , 1990 .

[10]  John N. Hooker,et al.  Generalized resolution and cutting planes , 1988 .

[11]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[12]  Samuel R. Buss.  Polynomial Size Proofs of the Propositional Pigeonhole Principle , 1987, J. Symb. Log..

[13]  J. Paris.  A Mathematical Incompleteness in Peano Arithmetic , 1977 .

[14]  Jeff B. Paris,et al.  A Hierarchy of Cuts in Models of Arithmetic , 1980 .

[15]  Andreas Goerdt.  Cuting Plane Versus Frege Proof Systems , 1990, CSL.

[16]  Pavel Pudlák,et al.  Ramsey's Theorem in Bounded Arithmetic , 1990, CSL.