The following pages link to (Q5004961):
Displaying 18 items.
- Reverse mathematics and marriage problems with finitely many solutions (Q335003) (← links)
- Effectiveness for infinite variable words and the dual Ramsey theorem (Q701747) (← links)
- In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
- Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\) (Q2258112) (← links)
- Using Ramsey's theorem once (Q2274133) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- The strength of infinitary Ramseyan principles can be accessed by their densities (Q2358627) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Proof mining and combinatorics. Program extraction for Ramsey's theorem for pairs (Q2898881) (← links)
- Nonstandard models in recursion theory and reverse mathematics (Q2925331) (← links)
- THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS (Q2976343) (← links)
- THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345) (← links)
- Reverse mathematics and infinite traceable graphs (Q3117776) (← links)
- Reverse mathematics and a Ramsey-type König's Lemma (Q4899173) (← links)
- Reverse mathematics and Ramsey's property for trees (Q4931100) (← links)
- Reverse mathematics of the finite downwards closed subsets of ordered by inclusion and adjacent Ramsey for fixed dimension (Q5109219) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Reverse mathematics and Ramsey properties of partial orderings (Q5963196) (← links)
