Promptness does not imply superlow cuppability

DOI10.2178/jsl/1254748690zbMath1197.03044OpenAlexW2004364799MaRDI QIDQ3655255

David E. Diamondstone

Publication date: 7 January 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1254748690

zbMATH Keywords

promptly simple setsuperlow cuppability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

Strengthening prompt simplicity ⋮ STRONG JUMP-TRACEABILITY ⋮ A random set which only computes strongly jump-traceable c.e. sets ⋮ Benign cost functions and lowness properties ⋮ CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES

Cites Work

• Unnamed Item
• Unnamed Item
• Lowness properties and randomness
• A Refinement of Lown and Highn for the R.E. Degrees
• Algorithmic Randomness and Complexity
• Calibrating Randomness
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Class groups of integral group rings

This page was built for publication: Promptness does not imply superlow cuppability