Upper bounds on ideals in the computably enumerable Turing degrees
From MaRDI portal
Publication:639654
DOI10.1016/j.apal.2010.12.005zbMath1227.03055OpenAlexW1978229737MaRDI QIDQ639654
Publication date: 22 September 2011
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.2010.12.005
Related Items (2)
Families of permutations and ideals of Turing degrees ⋮ Comparing the Medvedev and Turing degrees of Π01 classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing the strongly jump-traceable sets via randomness
- Incomparable prime ideals of recursively enumerable degrees
- On strongly jump traceable reals
- Index sets related to prompt simplicity
- Information-theoretic characterizations of recursive infinite strings
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- Benign cost functions and lowness properties
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- On the definable ideal generated by nonbounding c.e. degrees
- Randomness and Computability: Open Questions
- Low upper bounds of ideals
- Superhighness and Strong Jump Traceability
- Recursively enumerable sets and degrees
- PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
- Using random sets as oracles
- On the Degrees of Index Sets. II
This page was built for publication: Upper bounds on ideals in the computably enumerable Turing degrees
