Reverse Mathematics and Ramsey Properties of Partial Orderings
Jared Corduan, Marcia J. Groszek · Notre Dame Journal of Formal Logic · 2015
A partial ordering P is n-Ramsey if, for every coloring of n-element chains from P in finitely many colors, P has a homogeneous subordering isomorphic to P. 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 ACA0 over RCA0. A characterization theorem for finite-level partial orderings with Ramsey properties has been proven by the second author. We show, over RCA0, that one direction of the equivalence given by this theorem is equivalent to ACA0 (for n≥3), and the other is provable in ATR0. We answer Chubb, Hirst, and McNicholl’s second question by showing that there is a primitive recursive partial ordering P such that, over RCA0, “P is 2-Ramsey” is equivalent to ACA0.