Ramsey's Theorem in Bounded Arithmetic
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Examples of hard tautologies in the propositional calculus
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Examples of hard tautologies and worst-case complexity results for propositional proof systems
Examples of hard tautologies and worst-case complexity results for propositional proof systems
A note on propositional proof complexity of some Ramsey-type statements
Archive for Mathematical Logic
A rank lower bound for cutting planes proofs of ramsey's theorem
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
The complexity of proving that a graph is ramsey
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.89 |
We prove an exponential lower bound on the lengths of resolution proofs of propositions expressing the finite Ramsey theorem for pairs.