Rogers semilattices of families of two embedded sets in the Ershov hierarchy

DOI10.1002/malq.201100114zbMath1257.03071OpenAlexW1983032418MaRDI QIDQ2910992

Andrea Sorbi, S. A. Badaev, Manat Mustafa

Publication date: 12 September 2012

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: http://nur.nu.edu.kz/handle/123456789/972

zbMATH Keywords

computable numberingErshov hierarchyordinal notationRogers semilatticecomputable ordinal

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items

The branching theorem and computable categoricity in the Ershov hierarchy, Rogers semilattices with least and greatest elements in the Ershov hierarchy, Sums of Computable Ordinals, Rogers semilattices for families of equivalence relations in the Ershov hierarchy, Reductions between types of numberings

Cites Work

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