Lattice properties of Rogers semilattices of compuatble and generalized computable families

DOI10.33048/SEMI.2019.16.138zbMath1436.03230OpenAlexW3015293023MaRDI QIDQ2285202

M. Kh. Fajzrakhmanov

Publication date: 16 January 2020

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

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

zbMATH Keywords

Rogers semilatticecomputable enumerationgeneralized computable enumeration\(A\)-computable enumeration

Mathematics Subject Classification ID

Special subgroups (Frattini, Fitting, etc.) (20D25) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Two theorems on computable numberings
• Universal generalized computable numberings and hyperimmunity
• Some absolute properties of \(A\)-computable numberings
• The Rogers semilattices of generalized computable enumerations
• Generalized computable universal numberings
• Enumeration of families of general recursive functions
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Local structure of Rogers semilattices of Σn 0-computable numberings
• Relationships Between Reducibilities

This page was built for publication: Lattice properties of Rogers semilattices of compuatble and generalized computable families