On a problem of Cooper and Epstein
From MaRDI portal
Publication:4457726
DOI10.2178/jsl/1045861506zbMath1053.03022MaRDI QIDQ4457726
Publication date: 25 March 2004
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1045861506
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Cites Work
- On degrees of recursive unsolvability
- Complementing below recursively enumerable degrees
- Minimal pairs in initial segments of the recursively enumerable degrees
- Initial segments of degrees below 0′
- Minimal degrees of unsolvability and the full approximation construction
- The strong anticupping property for recursively enumerable degrees
- Initial segments of the degrees of unsolvability Part II: minimal degrees