Pages that link to "Item:Q2401697"
From MaRDI portal
The following pages link to Coloring trees in reverse mathematics (Q2401697):
Displaying 8 items.
- Ramsey's theorem for pairs and provably recursive functions (Q987936) (← links)
- Reverse mathematics and parameter-free transfer (Q1634526) (← links)
- On the strength of Ramsey's theorem for trees (Q2182273) (← links)
- The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (Q5004544) (← links)
- RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION (Q5070463) (← links)
- Reverse mathematics and Ramsey properties of partial orderings (Q5963196) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)
