Abstract
In this paper, we propose a weak regularity principle which is similar to both weak König's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle.
Citation
Stephen Flood. "Reverse mathematics and a Ramsey-type König's Lemma." J. Symbolic Logic 77 (4) 1272 - 1280, December 2012. https://doi.org/10.2178/jsl.7704120
Information
