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

Pavel Pudlák. A lower bound on the size of resolution proofs of the Ramsey theorem. Electronic Colloquium on Computational Complexity (ECCC), 18:162, 2011. [doi]

Abstract

Abstract is missing.