Pages that link to "Item:Q2892679"

The following pages link to RT₂² does not imply WKL₀ (Q2892679):

Displaying 41 items.

• Reverse mathematical bounds for the termination theorem (Q324248) (← links)
• Cohesive sets and rainbows (Q386619) (← links)
• The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
• Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
• The thin set theorem for pairs implies DNR (Q894259) (← links)
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
• Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles (Q1680523) (← links)
• \( \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)
• In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
• Separating weak \(\alpha\)-change and \(\alpha\)-change genericity (Q2140582) (← links)
• On the strength of Ramsey's theorem for trees (Q2182273) (← links)
• Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\) (Q2258112) (← links)
• Pigeons do not jump high (Q2313367) (← links)
• Coloring trees in reverse mathematics (Q2401697) (← links)
• Some logically weak Ramseyan theorems (Q2453567) (← links)
• Extracting randomness within a subset is hard (Q2663792) (← links)
• Separating principles below (Q2958212) (← links)
• Some Questions in Computable Mathematics (Q2973717) (← links)
• The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
• The Reverse Mathematics of wqos and bqos (Q3295152) (← 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)
• A computable analysis of majorizing martingales (Q5006388) (← links)
• An inside/outside Ramsey theorem and recursion theory (Q5036108) (← links)
• RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS (Q5070462) (← links)
• RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION (Q5070463) (← 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)
• On the computability of perfect subsets of sets with positive measure (Q5233979) (← links)
• A packed Ramsey’s theorem and computability theory (Q5247024) (← links)
• OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
• (Q5377469) (← links)
• Cone avoiding closed sets (Q5496642) (← links)
• The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem (Q6119673) (← links)
• Variations of statement, variations of strength. The case of the Rival-Sands theorems (Q6147850) (← links)
• The coding power of a product of partitions (Q6165184) (← links)
• (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)
• The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)