We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a larger program of unification of the separation proofs of various Ramsey-type theorems in reverse mathematics in order to obtain a better understanding of the combinatorics of Ramsey’s theorem and its consequences. We also answer a question of Murakami, Yamazaki and Yokoyama about pseudo Ramsey’s theorem for pairs.
CITATION STYLE
Patey, L. (2016). Partial orders and immunity in reverse mathematics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9709, pp. 353–363). Springer Verlag. https://doi.org/10.1007/978-3-319-40189-8_36
Mendeley helps you to discover research relevant for your work.