Embeddability of the semilattice \(L_m^0\) in Rogers semilattices

DOI10.1007/s10469-016-9390-9zbMath1403.03074OpenAlexW2525648991MaRDI QIDQ2364326

B. S. Kalmurzayev

Publication date: 18 July 2017

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-016-9390-9

zbMATH Keywords

Ershov hierarchyRogers semilatticecomputably enumerable \(m\)-degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items (2)

Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embeddability of the semilattice \(L_m^0\) in Rogers semilattices