Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

DOI10.1007/s10958-016-2857-3zbMath1349.03047OpenAlexW2344505286MaRDI QIDQ5741390

S. S. Ospichev

Publication date: 22 July 2016

Published in: Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2857-3

zbMATH Keywords

computable numberingErshov hierarchy

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

On universal pairs in the Ershov hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive undecidable numberings in the Ershov hierarchy
• Hierarchy of limiting computations
• Families without minimal numberings
• On a hierarchy of sets. III
• Elementary Theories for Rogers Semilattices
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Local structure of Rogers semilattices of Σn 0-computable numberings
• On the existence of universal numberings for finite families of d.c.e. sets