Friedberg numberings in the Ershov hierarchy

DOI10.1007/s10469-015-9349-2zbMath1375.03053OpenAlexW2253520939MaRDI QIDQ5899647

S. S. Ospichev

Publication date: 13 January 2016

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

Full work available at URL: https://doi.org/10.1007/s10469-015-9349-2

zbMATH Keywords

computable numberingErshov hierarchyFriedberg numbering

Mathematics Subject Classification ID

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

Related Items

Rogers semilattices of punctual numberings, Classifying equivalence relations in the Ershov hierarchy, On universal pairs in the Ershov hierarchy, \textit{CEA} operators and the ershov hierarchy, Friedberg numberings of families of partial computable functionals, Rogers semilattices for families of equivalence relations in the Ershov hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive undecidable numberings in the Ershov hierarchy
• Hierarchy of limiting computations
• Positive enumerations
• Computable structures and the hyperarithmetical hierarchy
• On a hierarchy of sets. III
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION