Tracing and domination in the Turing degrees
From MaRDI portal
Publication:764269
DOI10.1016/j.apal.2011.06.008zbMath1247.03082OpenAlexW1997159225MaRDI QIDQ764269
Publication date: 13 March 2012
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.2011.06.008
Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items
Cites Work
- Initial segments of the degrees of unsolvability
- Lowness properties and randomness
- Computational randomness and lowness
- Lowness notions, measure and domination
- Uniform almost everywhere domination
- Randomness and Computability: Open Questions
- MASS PROBLEMS AND HYPERARITHMETICITY
- Non-cupping, measure and computably enumerable splittings
- Minimal pairs and high recursively enumerable degrees
- Minimal degrees and the jump operator
- Highness and bounding minimal pairs
- Lowness for the class of random sets
- Almost everywhere domination and superhighness
- Low for random reals and positive-measure domination
- Almost everywhere domination
- On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
