On the cardinality of the upper semilattice of computable enumerations
From MaRDI portal
Publication:1214406
DOI10.1007/BF02219842zbMath0298.02035OpenAlexW2328227241MaRDI QIDQ1214406
Publication date: 1973
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02219842
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (10)
Rogers semilattices of punctual numberings ⋮ Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ On the embedding of the first nonconstructive ordinal in the Rogers semilattices ⋮ Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets ⋮ On universal pairs in the Ershov hierarchy ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Khutoretskii's theorem for generalized computable families ⋮ One-element Rogers semilattices in the Ershov hierarchy ⋮ Families without minimal numberings
This page was built for publication: On the cardinality of the upper semilattice of computable enumerations
