A Δ20 set with no infinite low subset in either it or its complement
From MaRDI portal
Publication:2758065
DOI10.2307/2695113zbMath0990.03046OpenAlexW2072032541MaRDI QIDQ2758065
Denis R. Hirschfeldt, Steffen Lempp, Rodney G. Downey, D. Reed Solomon
Publication date: 18 July 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695113
Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Theory of numerations, effectively presented structures (03D45)
Related Items (17)
Reverse Mathematics: The Playground of Logic ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Computable Reductions and Reverse Mathematics ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ Covering the Recursive Sets ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Primitive recursion and the chain antichain principle ⋮ Some Questions in Computable Mathematics ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ Reverse mathematics and a Ramsey-type König's Lemma ⋮ Covering the recursive sets ⋮ On the indecomposability of \(\omega^n\) ⋮ Partition Theorems and Computability Theory ⋮ \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models ⋮ The polarized Ramsey's theorem ⋮ The atomic model theorem and type omitting ⋮ Pigeons do not jump high
Cites Work
This page was built for publication: A Δ20 set with no infinite low subset in either it or its complement
