Bounding and nonbounding minimal pairs in the enumeration degrees
From MaRDI portal
Publication:5718686
DOI10.2178/jsl/1122038912zbMath1093.03029MaRDI QIDQ5718686
Yue Yang, Andrea Sorbi, S. Barry Cooper, Ang Sheng Li
Publication date: 16 January 2006
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1122038912
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
IN MEMORIAM: BARRY COOPER 1943–2015, Cupping and definability in the local structure of the enumeration degrees, Strong enumeration reducibilities, How enumeration reductibility yields extended Harrington non-splitting
Cites Work