Discretely ordered modules as a first-order extension of the cutting planes proof system
- 1 December 1998
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 63 (4), 1582-1596
- https://doi.org/10.2307/2586668
Abstract
We define a first-order extension LK(CP) of the cutting planes proof system CP as the first-order sequent calculus LK whose atomic formulas are CP-inequalities ∑i ai · xi ≥ b (xi's variables, ai's and b constants). We prove an interpolation theorem for LK(CP) yielding as a corollary a conditional lower bound for LK(CP)-proofs. For a subsystem R(CP) of LK(CP), essentially resolution working with clauses formed by CP-inequalities, we prove a monotone interpolation theorem obtaining thus an unconditional lower bound (depending on the maximum size of coefficients in proofs and on the maximum number of CP-inequalities in clauses). We also give an interpolation theorem for polynomial calculus working with sparse polynomials.The proof relies on a universal interpolation theorem for semantic derivations [16, Theorem 5.1].LK(CP) can be viewed as a two-sorted first-order theory of Z considered itself as a discretely ordered Z-module. One sort of variables are module elements, another sort are scalars. The quantification is allowed only over the former sort. We shall give a construction of a theory LK(M) for any discretely ordered module M (e.g., LK(Z) extends LK(CP)). The interpolation theorem generalizes to these theories obtained from discretely ordered Z-modules. We shall also discuss a connection to quantifier elimination for such theories.We formulate a communication complexity problem whose (suitable) solution would allow to improve the monotone interpolation theorem and the lower bound for R(CP).Keywords
This publication has 12 references indexed in Scilit:
- An Exponential Lower Bound for the Size of Monotone Real CircuitsJournal of Computer and System Sciences, 1999
- Algebraic models of computation and interpolation for algebraic proof systemsPublished by American Mathematical Society (AMS) ,1997
- Monotone real circuits are more powerful than monotone boolean circuitsInformation Processing Letters, 1997
- Proof complexity in algebraic systems and bounded depth Frege systems with modular countingcomputational complexity, 1996
- Some consequences of cryptographical conjectures for S 2 1 and EFLecture Notes in Computer Science, 1995
- Quantifier elimination for modules with scalar variablesAnnals of Pure and Applied Logic, 1992
- On the complexity of cutting-plane proofsDiscrete Applied Mathematics, 1987
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- An Algorithmic Theory of Numbers, Graphs and ConvexityPublished by Society for Industrial & Applied Mathematics (SIAM) ,1986
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983