The upward closure of a perfect thin class
From MaRDI portal
Publication:958485
DOI10.1016/j.apal.2008.06.006zbMath1153.03018MaRDI QIDQ958485
Noam Greenberg, Joseph S. Miller, Rodney G. Downey
Publication date: 5 December 2008
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.06.006
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D80: Applications of computability and recursion theory
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal theories
- Countable thin \(\Pi^0_1\) classes
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
- Algorithmic Randomness and Complexity
- Mass Problems and Randomness
- Calibrating Randomness
- Measure and minimal degrees
- Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
- An extension of the recursively enumerable Turing degrees
- Computability and Randomness
- Axiomatizable theories with few axiomatizable extensions
- ∏ 0 1 Classes and Degrees of Theories