Formula omitted] does not imply [formula omitted] in ω-models

Abstract

We complete a 40-year old program on the computability-theoretic analysis of Ramsey's theorem, starting with Specker and Jockusch in 1971/1972, by improving a result of Chong, Slaman and Yang in 2014. Given a set X, let [X]n be the collection of all n-element subsets of X. Ramsey's theorem for n-tuples asserts the existence, for every finite coloring of [ω]n, of an infinite set X⊆ω such that [X]n is monochromatic. The meta-mathematical study of Ramsey theory has a rich history, with several long-standing open problems and seminal theorems, including Seetapun's theorem in 1995 and Liu's theorem in 2012 about Ramsey's theorem for pairs. The remaining question about the study of Ramsey's theorem from a computational viewpoint was the relation between Ramsey's theorem for pairs (RT22) and its restriction to stable colorings (SRT22), that is, colorings admitting a limit behavior. Chong, Slaman and Yang first proved that SRT22 does not formally imply RT22 in a proof-theoretic sense, using non-standard models of reverse mathematics. In this article, we answer the open question whether this non-implication also holds within the framework of computability theory. More precisely, we construct an ω-model of SRT22 which is not a model of RT22. For this, we design a new notion of effective forcing refining Mathias forcing using the notion of largeness classes.