Families without minimal numberings

DOI10.1007/S10469-014-9290-9zbMath1318.03049OpenAlexW1993110892MaRDI QIDQ2342320

K. Sh. Abeshev, S. A. Badaev, Manat Mustafa

Publication date: 11 May 2015

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

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

zbMATH Keywords

computable numberingErshov hierarchyminimal numbering

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Friedberg numberings of families of partial computable functionals ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ Reductions between types of numberings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computability with functionals
• On the cardinality of the upper semilattice of computable enumerations
• Computable structures and the hyperarithmetical hierarchy
• On a hierarchy of sets. III
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• On the existence of universal numberings for finite families of d.c.e. sets

This page was built for publication: Families without minimal numberings