Weak reducibility of computable and generalized computable numberings

DOI10.33048/SEMI.2021.18.035OpenAlexW3201150822MaRDI QIDQ2033333

Zlata Konstantinovna Ivanova, M. Kh. Fajzrakhmanov

Publication date: 17 June 2021

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2021.18.035

zbMATH Keywords

computable numbering\(A\)-computable numberingRogers semilattice\(w\)-reducibility

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Positive enumerations
• Universal generalized computable numberings and hyperimmunity
• Khutoretskii's theorem for generalized computable families
• Generalized computable universal numberings
• Minimal generalized computable enumerations and high degrees
• Turing Computability
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Local structure of Rogers semilattices of Σn 0-computable numberings
• The degrees of bi‐immune sets

This page was built for publication: Weak reducibility of computable and generalized computable numberings