Pages that link to "Item:Q3616350"
From MaRDI portal
The following pages link to Reverse mathematics, computability, and partitions of trees (Q3616350):
Displaying 18 items.
- Binary subtrees with few labeled paths (Q654001) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\) (Q1016503) (← links)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- On the strength of Ramsey's theorem for trees (Q2182273) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- Some logically weak Ramseyan theorems (Q2453567) (← links)
- Nonstandard models in recursion theory and reverse mathematics (Q2925331) (← links)
- THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS (Q2976343) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- Partition Theorems and Computability Theory (Q3370615) (← links)
- Reverse mathematics and Ramsey's property for trees (Q4931100) (← links)
- RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION (Q5070463) (← links)
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 (Q5305554) (← links)
- Reverse mathematics and Ramsey properties of partial orderings (Q5963196) (← links)
- Reverse mathematics and the coloring number of graphs (Q5963197) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)
