One-element Rogers semilattices in the Ershov hierarchy

DOI10.1007/S10469-021-09653-9OpenAlexW4200420945MaRDI QIDQ2066095

B. S. Kalmurzayev, S. A. Badaev, N. Mukash, Manat Mustafa

Publication date: 13 January 2022

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

Full work available at URL: https://doi.org/10.1007/s10469-021-09653-9

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites Work

• Families of general recursive functions with a finite number of limit points
• On the cardinality of the upper semilattice of computable enumerations
• Two theorems on computable numberings
• Computable enumerations of families of general recursive functions
• Some absolute properties of \(A\)-computable numberings
• Reductions between types of numberings
• Enumeration of families of general recursive functions
• CONSTRUCTIVE ALGEBRAS I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: One-element Rogers semilattices in the Ershov hierarchy