No feasible interpolation for TC/sup 0/-Frege proofs

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 TC/sup 0/-Frege systems. More specifically, we show that unless factoring is feasible, neither Frege nor TC/sup 0/-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-size TC/sup 0/-Frege. In particular, we show how to carry out the proof for the Chinese Remainder Theorem, which may be of independent interest. As a corollary, we obtain that TC/sup 0/-Frege as well as any proof system that polynomially simulates it, is not automatizable (under a hardness assumption).

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

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

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

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

[5]  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.

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

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

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

[9]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S_2^1 and EF , 1994, LCC.

[10]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.

[11]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

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

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

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

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

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

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

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

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

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