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
|
129
|
Natural proofs
– Razborov, Rudich
- 1997
|
|
120
|
Exponential lower bounds for the pigeonhole principle
– Pitassi, Beame, et al.
- 1993
|
|
104
|
The complexity of the pigeonhole principle
– Ajtai
- 1988
|
|
98
|
Feasibly constructive proofs and the propositional calculus (preliminary version
– Cook
- 1975
|
|
83
|
On a problem of graph theory
– Erdos, Renyi, et al.
|
|
74
|
Counting problems in bounded arithmetic
– Paris, Wilkie
- 1985
|
|
58
|
A Woods. Exponential lower bounds to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms
– Krajíček, Pudlák
- 1995
|
|
55
|
Propositional proof systems, the consistency of first order theories and the complexity of computations
– Krajíček, Pudlák
- 1989
|
|
54
|
The Boolean formula value problem is in ALOGTIME
– Buss
- 1987
|
|
52
|
The circuit value problem is log space complete for P
– Ladner
- 1975
|
|
39
|
Short proofs for tricky formulas
– Krishnamurthy
- 1985
|
|
37
|
An optimal parallel algorithm for formula evaluation
– Buss, Cook, et al.
- 1992
|
|
28
|
Linear Algebra Methods in Combinatorics I, preliminary version
– Babai, Frankl
- 1988
|
|
25
|
On the trace of finite sets
– FRANKL
- 1983
|
|
25
|
On time hardware complexity tradeoffs for Boolean functions,in
– Spira
- 1971
|
|
20
|
On embedding graphs in squashed cubes
– Graham, Pollak
- 1973
|
|
19
|
Complexity of derivations from quantifier-free Horn formulae, mechanical introduction of explicit definitions, and refinement of completeness theorems
– Statman
- 1977
|
|
16
|
On the lengths of proofs in the propositional calculus (preliminary version
– Cook, Reckhow
- 1974
|
|
15
|
Exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle, Random Structures and Algorithms
– cek, ak, et al.
- 1995
|
|
14
|
On Frege and Extended Frege Proof Systems
– Kraj'icek
- 1995
|
|
14
|
Ramsey’s theorem in bounded arithmetic
– Pudlák
- 1990
|
|
11
|
cek and P. Pudl ak, Propositional proof systems, the consistency of first-order theories and the complexity of computations
– Kraj
- 1989
|
|
8
|
size proofs of the propositional pigeonhole principle
– Polynomial
- 1987
|
|
8
|
Examples of hard tautologies in the propositional calculus
– Krishnamurthy, Moll
- 1981
|
|
8
|
On time hardware complexity tradeo#s for Boolean functions
– Spira
- 1971
|
|
7
|
The Power of Weak Formal Systems
– Pitassi
- 1992
|
|
5
|
The USe of abstract language in elementary metamathematics: Some pedagogical examples
– Kreisel, Mints, et al.
- 1975
|
|
4
|
consistency proofs, Annals of Pure and
– Propositional
- 1991
|
|
4
|
Open problems in: Arithmetic, Proof theory and computorial complexity, Oxford university press
– Clote, Krajicek
- 1993
|
|
4
|
and Gy orgy Tur' an, Resolution proofs of generalized pigeonhole principles
– Buss
- 1988
|
|
4
|
cek, On Frege and Extended Frege Proof Systems
– Kraj
- 1993
|
|
4
|
and Győrgy Turán, Resolution proofs of generalized pigeonhole principles
– Buss
- 1988
|
|
2
|
Propositional proof systems, the consistency of first-order theories and the complexity of computations
– KRAJfCEK, PUDLK
- 1989
|
|
2
|
Exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Typeset manuscript
– KRAJfEK, PUDLK, et al.
- 1991
|
|
2
|
The friendship theorem
– LONGYEAR, PARSONS
- 1972
|
|
2
|
The friendship theorem, in Combinatorial mathematics and its applications
– WILF
- 1971
|
|
2
|
os, On a problem of graph theory
– os, enyi, et al.
- 1966
|
|
1
|
AND GY6RGY TURXN, Resolution proofs of generalized pigeonhole principles
– Buss
- 1988
|
|
1
|
Feasibly constructive prooff and the propositional calculus
– CooK
- 1975
|
|
1
|
On a problem of graph theory
– ERD6S, RINYI, et al.
- 1966
|
|
1
|
Talk presented at Workshop on Feasible Mathematics
– KRAJfEK
|
|
1
|
On Frege and extended Frege proof systems. Typeset manuscript
– KRAJfEK
- 1993
|
|
1
|
Ramsey's theorem in bounded arithmetic
– PUDLXK
- 1992
|
|
1
|
cek, Some open problems in arithmetic, proof theory and computational complexity
– Clote, Kraj
- 1993
|
|
1
|
cek. Talk presented at Workshop on Feasible Mathematics
– Kraj
|
|
1
|
ak, Ramsey's theorem in bounded arithmetic
– Pudl
- 1992
|
|
1
|
Talk presented at Workshop on Feasible Mathematics
– Krajíček
|
|
