Are thereHardExamples for Frege Systems ?

It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. Surprisingly, we conclude that no particularly good or convincing examples are known. The examples of combinatorial tautologies that we consider seem to give at most a quasipolynomial speed-up of extended Frege proofs over Frege proofs, with the sole possible exception of tautologies based on a theorem of Frankl. It is shown that Bondy's theorem and a version of the Kruskal-Katona theorem actually have polynomial-size Frege proofs. Bondy's theorem is shown to have constant-depth, polynomial-size proofs in Frege+PHP, and to be equivalent in I 0 to the pigeonhole principle.

[1]  R. Impagliazzo,et al.  Exponential lower bounds for the pigeonhole principle , 1993, computational complexity.

[2]  Samuel R. Buss,et al.  An Optimal Parallel Algorithm for Formula Evaluation , 1992, SIAM J. Comput..

[3]  Samuel R. Buss,et al.  Propositional Consistency Proofs , 1991, Ann. Pure Appl. Log..

[4]  Jan Krajícek,et al.  Propositional proof systems, the consistency of first order theories and the complexity of computations , 1989, Journal of Symbolic Logic.

[5]  Samuel R. Buss,et al.  Resolution Proofs of Generalized Pigeonhole Principles , 1988, Theor. Comput. Sci..

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

[7]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

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

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

[10]  S. Cook,et al.  On the lengths of proofs in the propositional calculus (Preliminary Version) , 1974, STOC '74.

[11]  Toniann Pitassi,et al.  The power of weak formal systems , 1992 .

[12]  P. Frankl,et al.  Linear Algebra Methods in Combinatorics I , 1988 .

[13]  A. Wilkie,et al.  Counting problems in bounded arithmetic , 1985 .

[14]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[15]  R. Graham,et al.  On embedding graphs in squashed cubes , 1972 .

[16]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[17]  A. Razborov,et al.  Natural proofs , 1994, STOC '94.

[18]  Jan Kraj Cek,et al.  Electronic Colloquium on Computational Complexity an Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle , 2022 .