The class of recursively enumerable subsets of a recursively enumerabl e set
From MaRDI portal
Publication:2559464
DOI10.2140/pjm.1973.46.167zbMath0257.02032OpenAlexW2069987267MaRDI QIDQ2559464
Publication date: 1973
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1973.46.167
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (4)
The Halting Problem Relativized to Complements ⋮ Recursively enumerable sets and degrees ⋮ Computational complexity, speedable and levelable sets ⋮ Upper semilattice of recursively enumerable Q-degrees
This page was built for publication: The class of recursively enumerable subsets of a recursively enumerabl e set