Pages that link to "Item:Q2976343"

The following pages link to THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS (Q2976343):

Displaying 12 items.

• Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\) (Q1016503) (← links)
• On the strength of Ramsey's theorem for trees (Q2182273) (← links)
• Coloring trees in reverse mathematics (Q2401697) (← links)
• Separating principles below (Q2958212) (← links)
• On the Π₁ ¹ -separation principle (Q3545211) (← links)
• Finding paths through narrow and wide trees (Q3616357) (← links)
• On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
• Reverse mathematics and Ramsey's property for trees (Q4931100) (← links)
• The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (Q5004544) (← 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)