An almost-universal cupping degree
From MaRDI portal
Publication:3107348
DOI10.2178/jsl/1318338843zbMath1247.03077OpenAlexW2086472732MaRDI QIDQ3107348
Publication date: 23 December 2011
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1318338843
Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)
Related Items (1)
Cites Work
This page was built for publication: An almost-universal cupping degree