Cone avoiding closed sets
From MaRDI portal
Publication:5496642
DOI10.1090/S0002-9947-2014-06049-2zbMath1369.03101arXiv1602.03777MaRDI QIDQ5496642
Publication date: 2 February 2015
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.03777
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) 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) Algorithmic randomness and dimension (03D32)
Related Items (18)
An inside/outside Ramsey theorem and recursion theory ⋮ Partial Orders and Immunity in Reverse Mathematics ⋮ RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Coloring trees in reverse mathematics ⋮ The reverse mathematics of non-decreasing subsequences ⋮ Extracting randomness within a subset is hard ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ Some Questions in Computable Mathematics ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Computing sets from all infinite subsets ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models ⋮ Pigeons do not jump high ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma ⋮ Thin set versions of Hindman's theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Infinite subsets of random sets of integers
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- RT22 does not imply WKL0
- A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS
- Algorithmic Randomness and Complexity
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- Ramsey's theorem and cone avoidance
- A fixed-point-free minimal degree
- Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
- Diagonally non-recursive functions and effective Hausdorff dimension
- Comparing DNR and WWKL
- Computability and Randomness
- Enumerations of the Kolmogorov function
- Ramsey's theorem and recursion theory
This page was built for publication: Cone avoiding closed sets
