On Interpolation and Automatization for Frege Systems

The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this paper, we show that this method cannot be used to obtain lower bounds for Frege systems, or even for TC0-Frege systems. More specifically, we show that unless factoring (of Blum integers) is feasible, neither Frege nor TC0-Frege has the feasible interpolation property. In order to carry out our argument, we show how to carry out proofs of many elementary axioms/theorems of arithmetic in polynomial-sized TC0-Frege. As a corollary, we obtain that TC0-Frege, as well as any proof system that polynomially simulates it, is not automatizable (under the assumption that factoring of Blum integers is hard). We also show under the same hardness assumption that the k-provability problem for Frege systems is hard.

[1]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S12 and EF , 1998, Inf. Comput..

[2]  Discretely Ordered Modules as a First-Order Extension of The Cutting Planes Proof System , 1998, J. Symb. Log..

[3]  Denis Thérien,et al.  Threshold Circuits of Small Majority-Depth , 1998, Inf. Comput..

[4]  Peter Clote,et al.  Cutting planes, connectivity, and threshold logic , 1996, Arch. Math. Log..

[5]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[6]  Manfred Kudlek,et al.  On the Complexity of Propositional Calculus Formulae , 2001, Sci. Ann. Cuza Univ..

[7]  Daniele Mundici A lower bound for the complexity of Craig's interpolants in sentential logic , 1983, Arch. Math. Log..

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[10]  Daniele Mundici Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity , 1984, Ann. Pure Appl. Log..

[11]  Toniann Pitassi,et al.  On ACC 0 [ p k ] Frege proofs , 1997, STOC 1997.

[12]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[13]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.

[14]  Samuel R. Buss,et al.  The Undecidability of k-Provability , 1991, Ann. Pure Appl. Log..

[15]  P. Pudlák Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

[16]  Stephen A. Cook,et al.  An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..

[17]  Jirí Sgall,et al.  Algebraic models of computation and interpolation for algebraic proof systems , 1996, Proof Complexity and Feasible Arithmetics.

[18]  S. Buss On Gödel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability , 1995 .

[19]  Jan Kraj Discretely Ordered Modules as a Rst-order Extension of the Cutting Planes Proof System , .

[20]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[21]  Michael Alekhnovich,et al.  Minimum propositional proof length is NP-hard to linearly approximate , 1998, Journal of Symbolic Logic.

[22]  A. Razborov Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .

[23]  Russell Impagliazzo,et al.  Upper and lower bounds for tree-like cutting planes proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[24]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[25]  Dan Boneh,et al.  Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring , 1997, Electron. Colloquium Comput. Complex..

[26]  Jan Kra,et al.  Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .