Ramsey-like theorems for the Schreier barrier

Abstract

The family of finite subsets $s$ of the natural numbers such that $|s|=1+\min s$ is known as the Schreier barrier in combinatorics and Banach Space theory, and as the family of exactly $\ddot{I}‰$-large sets in Logic. We formulate and prove the generalizations of Friedman's Free Set and Thin Set theorems and of Rainbow Ramsey's theorem to colorings of the Schreier barrier. We analyze the strength of these theorems from the point of view of Computability Theory and Reverse Mathematics. Surprisingly, the exactly $\ddot{I}‰$-large counterparts of the Thin Set and Free Set theorems can code ${\varnothing }^{(\ddot{I}‰)}$, while the exactly $\ddot{I}‰$-large Rainbow Ramsey theorem does not code the halting set.

32 pages; Corrected proof of Proposition 3.12