The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
From MaRDI portal
Publication:3530396
zbMath1167.03009arXiv1408.2897MaRDI QIDQ3530396
Bjørn Kjos-Hanssen, Theodore A. Slaman, Steffen Lempp, Carl G. jun. Jockusch, Denis R. Hirschfeldt
Publication date: 20 October 2008
Full work available at URL: https://arxiv.org/abs/1408.2897
reverse mathematicscohesive setRamsey's theorem for pairsWeak König's Lemmacomputable stable 2-coloring of pairsdiagonally non-recursive functionsinfinite homogeneous set
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)
Related Items
An inside/outside Ramsey theorem and recursion theory, On notions of computability-theoretic reduction between Π21 principles, Partial Orders and Immunity in Reverse Mathematics, RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS, Dominating the Erdős-Moser theorem in reverse mathematics, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, The thin set theorem for pairs implies DNR, ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM, Some Questions in Computable Mathematics, Degrees bounding principles and universal instances in reverse mathematics, Computing sets from all infinite subsets, \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models, The polarized Ramsey's theorem, Pigeons do not jump high, Cone avoiding closed sets, The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma
