Mar 3, 2012 - theorem says that for every n, k ∈ N and every function (called a ... Weak König's lemma and Ramsey's theorem can be thought of as asserting.
REVERSE MATHEMATICS AND ¨ A RAMSEY-TYPE KONIG’S LEMMA
arXiv:1111.2526v2 [math.LO] 3 Mar 2012
STEPHEN FLOOD
Abstract. In this paper, we propose a weak regularity principle which is similar to both weak K¨ onig’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.
1. Introduction Weak K¨ onig’s lemma states that for any infinite binary tree T ⊆ 2
