Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Ramsey's theorem in the hierarchy of choice principles
Andreas Blass
Journal of Symbolic Logic | VOL. 42
Andreas BlassAndreas Blass
01 Sep 1977
An intuitionistic version of Ramsey's Theorem and its use in Program Termination
Stefano Berardi ... Silvia Steila
Annals of Pure and Applied Logic | VOL. 166
Stefano Berardi, et. al.Stefano Berardi ... Silvia Steila
20 Aug 2015
Ramsey's Theorem for Pairs and Provably Recursive Functions
Ulrich Kohlenbach ... Alexander Kreuzer
Notre Dame Journal of Formal Logic | VOL. 50
Ulrich Kohlenbach, et. al.Ulrich Kohlenbach ... Alexander Kreuzer
01 Oct 2009
Ramsey's Theorem does not Hold in Recursive Set Theory
E Specker
Studies in Logic and the Foundations of Mathematics | VOL. 61
E SpeckerE Specker
01 Jan 1970
View more papers

More From: Information Processing Letters

Paper Title
Journal
Date
Author
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees
Fuki Ito
Information Processing Letters | VOL. 187
Fuki ItoFuki Ito
10 May 2024
Lower and upper bounds on graph communicabilities
Amir Hossein Ghodrati ... Mohammad Ali Hosseinzadeh
Information Processing Letters | VOL. 187
Amir Hossein Ghodrati, et. al.Amir Hossein Ghodrati ... Mohammad Ali Hosseinzadeh
08 May 2024
On conflict-free cuts: Algorithms and complexity
Johannes Rauch ... Uéverton S Souza
Information Processing Letters | VOL. 187
Johannes Rauch, et. al.Johannes Rauch ... Uéverton S Souza
08 May 2024
Improved lower bound for differentially private facility location
Pasin Manurangsi
Information Processing Letters | VOL. 187
Pasin ManurangsiPasin Manurangsi
07 May 2024
View more papers