CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
From MaRDI portal
Publication:5858920
DOI10.1017/JSL.2020.36zbMath1485.03147OpenAlexW3096852731MaRDI QIDQ5858920
Keng Meng Ng, Noam Greenberg, Guohua Wu
Publication date: 15 April 2021
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2020.36
Related Items (1)
Cites Work
- The continuity of cupping to \(\text \textbf{0}'\)
- A hierarchy for cuppable degrees
- An almost deep degree
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Promptness does not imply superlow cuppability
- The undecidability of the recursively enumerable degrees
- Interpretability and Definability in the Recursively Enumerable Degrees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
