Friedberg numberings in the Ershov hierarchy

DOI10.1007/s00153-014-0402-yzbMath1341.03055OpenAlexW1984932407MaRDI QIDQ5919177

Andrea Sorbi, S. A. Badaev, Manat Mustafa

Publication date: 23 February 2015

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

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

zbMATH Keywords

computable numberingErshov hierarchyFriedberg numberingminimal numberingRogers semilattice

Mathematics Subject Classification ID

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

• A learning-theoretic characterization of classes of recursive functions
• Positive undecidable numberings in the Ershov hierarchy
• Some applications of computable one-one numberings
• Computable single-valued numerations
• Problem of the number of non-self-equivalent constructivizations
• Computable structures and the hyperarithmetical hierarchy
• Enumeration of families of general recursive functions
• On a hierarchy of sets. III
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Friedberg numberings in the Ershov hierarchy