Translator Disclaimer
2016 Reverse Mathematics and Ramsey Properties of Partial Orderings
Jared Corduan, Marcia Groszek
Notre Dame J. Formal Logic 57(1): 1-25 (2016). DOI: 10.1215/00294527-3314771


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 n3), 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.


Download Citation

Jared Corduan. Marcia Groszek. "Reverse Mathematics and Ramsey Properties of Partial Orderings." Notre Dame J. Formal Logic 57 (1) 1 - 25, 2016.


Received: 11 June 2012; Accepted: 23 July 2013; Published: 2016
First available in Project Euclid: 9 September 2015

zbMATH: 1353.03007
MathSciNet: MR3447722
Digital Object Identifier: 10.1215/00294527-3314771

Primary: 03B30
Secondary: 03F35, 05C55

Rights: Copyright © 2016 University of Notre Dame


Vol.57 • No. 1 • 2016
Back to Top