A partial ordering is -Ramsey if, for every coloring of -element chains from in finitely many colors, has a homogeneous subordering isomorphic to . In their paper on Ramsey properties of the complete binary tree, Chubb, Hirst, and McNicholl ask about Ramsey properties of other partial orderings. They also ask whether there is some Ramsey property for pairs equivalent to over .
A characterization theorem for finite-level partial orderings with Ramsey properties has been proven by the second author. We show, over , that one direction of the equivalence given by this theorem is equivalent to (for ), and the other is provable in .
We answer Chubb, Hirst, and McNicholl’s second question by showing that there is a primitive recursive partial ordering such that, over , “ is 2-Ramsey” is equivalent to .
"Reverse Mathematics and Ramsey Properties of Partial Orderings." Notre Dame J. Formal Logic 57 (1) 1 - 25, 2016. https://doi.org/10.1215/00294527-3314771