On some examples of upper semilattices of computable enumerations
From MaRDI portal
Publication:1217117
DOI10.1007/BF02218587zbMath0305.02059OpenAlexW2010050610MaRDI QIDQ1217117
Publication date: 1975
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186810
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)
Related Items
2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Two theorems on minimal generalized computable numberings ⋮ Ideals without minimal elements in Rogers semilattices ⋮ A family with a single minimal but not least numbering ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Reductions between types of numberings
Cites Work
This page was built for publication: On some examples of upper semilattices of computable enumerations
