RT22 does not imply WKL0
From MaRDI portal
Publication:2892679
DOI10.2178/jsl/1333566640zbMath1245.03095arXiv1602.03784OpenAlexW1560798351MaRDI QIDQ2892679
Publication date: 19 June 2012
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.03784
RCARamseyreverse mathematicscomputabilityweak König's lemmaWKLrecursion theoryMathias forcingcone avoidancePA degree
Foundations of classical theories (including reverse mathematics) (03B30) Models of arithmetic and set theory (03C62) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
An inside/outside Ramsey theorem and recursion theory ⋮ Separating weak \(\alpha\)-change and \(\alpha\)-change genericity ⋮ Reverse mathematical bounds for the termination theorem ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Coloring trees in reverse mathematics ⋮ Extracting randomness within a subset is hard ⋮ Cohesive sets and rainbows ⋮ Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles ⋮ On the strength of Ramsey's theorem for trees ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ The thin set theorem for pairs implies DNR ⋮ The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ Separating principles below ⋮ Variations of statement, variations of strength. The case of the Rival-Sands theorems ⋮ The coding power of a product of partitions ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ Some Questions in Computable Mathematics ⋮ Some logically weak Ramseyan theorems ⋮ The Reverse Mathematics of wqos and bqos ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Computing sets from all infinite subsets ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\) ⋮ \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models ⋮ Unnamed Item ⋮ Pigeons do not jump high ⋮ On the computability of perfect subsets of sets with positive measure ⋮ Cone avoiding closed sets ⋮ A packed Ramsey’s theorem and computability theory ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma ⋮ A computable analysis of majorizing martingales ⋮ Thin set versions of Hindman's theorem ⋮ In search of the first-order part of Ramsey's theorem for pairs
Cites Work
