Iterative forcing and hyperimmunity in reverse mathematics
From MaRDI portal
Publication:4593493
DOI10.3233/COM-160062zbMath1420.03028OpenAlexW2611559549MaRDI QIDQ4593493
Publication date: 22 November 2017
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-160062
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Recursively (computably) enumerable sets and degrees (03D25) Second- and higher-order arithmetic and fragments (03F35)
Related Items
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ Extracting randomness within a subset is hard ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ Pigeons do not jump high ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma