The following pages link to Cone avoiding closed sets (Q5496642):
Displaying 18 items.
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models (Q2048618) (← links)
- Thin set versions of Hindman's theorem (Q2108578) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- The reverse mathematics of non-decreasing subsequences (Q2402955) (← links)
- Extracting randomness within a subset is hard (Q2663792) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- Partial Orders and Immunity in Reverse Mathematics (Q3188275) (← links)
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM (Q4600456) (← links)
- On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
- The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (Q5004544) (← links)
- An inside/outside Ramsey theorem and recursion theory (Q5036108) (← links)
- RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS (Q5070462) (← links)
- THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS (Q5070472) (← links)
- Computing sets from all infinite subsets (Q5158110) (← links)
- The weakness of the pigeonhole principle under hyperarithmetical reductions (Q5163163) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)
