论文信息 - A lower bound on the size of resolution proofs of the Ramsey theorem - 字舞流文

A lower bound on the size of resolution proofs of the Ramsey theorem

We prove an exponential lower bound on the lengths of resolution proofs of propositions expressing the finite Ramsey theorem for pairs.

[1] Jan Kraj́ıček,et al. A note on propositional proof complexity of some Ramsey-type statements , 2011, Arch. Math. Log..

[2] J. Kraj. On the Weak Pigeonhole Principle , 2001 .

[3] Balakrishnan Krishnamurthy. Examples of hard tautologies and worst-case complexity results for propositional proof systems , 1981 .

[4] Pavel Pudlák,et al. Ramsey's Theorem in Bounded Arithmetic , 1990, CSL.

[5] J. Krajícek. On the weak pigeonhole principle , 2001 .

[6] Robert Moll,et al. Examples of hard tautologies in the propositional calculus , 1981, STOC '81.

[7] Jan Krajícek,et al. Lifting independence results in bounded arithmetic , 1999, Arch. Math. Log..