Reverse mathematics, computability, and partitions of trees

DOI10.2178/jsl/1231082309zbMath1162.03009OpenAlexW2078669210MaRDI QIDQ3616350

Timothy H. McNicholl, Jennifer Chubb, Jeffry L. Hirst

Publication date: 25 March 2009

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

Full work available at URL: https://repository.usfca.edu/math/4

zbMATH Keywords

reverse mathematicscoloringRamsey's theoremfull binary treemonochromatic subtree

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Related Items

Open Questions in Reverse Mathematics, 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09, Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees, RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION, NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, Coloring trees in reverse mathematics, On the strength of Ramsey's theorem for trees, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, Some logically weak Ramseyan theorems, Ramsey's theorem for trees: the polarized tree theorem and notions of stability, Reverse mathematics and Ramsey's property for trees, Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\)

Cites Work

• Unnamed Item
• Unnamed Item
• A canonical partition theorem for equivalence relations on \(Z^ n\).
• A Ramsey theorem for trees
• On the strength of Ramsey's theorem for pairs
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
• Class groups of integral group rings