Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
From MaRDI portal
Publication:3655265
DOI10.2178/jsl/1254748700zbMath1182.03107OpenAlexW1996708658MaRDI QIDQ3655265
Theodore A. Slaman, Peter A. Cholak, Carl G. jun. Jockusch
Publication date: 7 January 2010
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1254748700
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 ⋮ Open Questions in Reverse Mathematics ⋮ On notions of computability-theoretic reduction between Π21 principles ⋮ Term extraction and Ramsey's theorem for pairs ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ Subsets coded in elementary end extensions ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs ⋮ Weaker cousins of Ramsey's theorem over a weak base theory ⋮ The inductive strength of Ramsey's theorem for pairs ⋮ Ramsey's theorem for trees: the polarized tree theorem and notions of stability ⋮ Cone avoiding closed sets ⋮ A packed Ramsey’s theorem and computability theory
Cites Work
