Reverse mathematics and Ramsey's property for trees

DOI10.2178/jsl/1278682209zbMath1203.03018OpenAlexW2058687150MaRDI QIDQ4931100

Joseph R. Mileti, Jared R. Corduan, Marcia J. Groszek

Publication date: 4 October 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1278682209

zbMATH Keywords

treeACARCApartial orderinductionreverse mathematicsRamsey propertypigeonhole principlepairs

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (7)

Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ Coloring trees in reverse mathematics ⋮ On the strength of Ramsey's theorem for trees ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ On the computability of perfect subsets of sets with positive measure ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma

Cites Work

• On the strength of Ramsey's theorem for pairs
• Reverse mathematics, computability, and partitions of trees
• Unnamed Item

This page was built for publication: Reverse mathematics and Ramsey's property for trees