The Rogers semilattices of generalized computable enumerations

DOI10.1134/S0037446617060192zbMath1420.03094OpenAlexW2789438104MaRDI QIDQ1745093

M. Kh. Fajzrakhmanov

Publication date: 20 April 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446617060192

zbMATH Keywords

hyperimmune setRogers semilatticecomputable enumerationgeneralized computable enumerationminimal enumerationuniversal enumeration

Mathematics Subject Classification ID

Algebraic aspects of posets (06A11) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items

Two theorems on minimal generalized computable numberings, Minimal generalized computable numberings and families of positive preorders, Lattice properties of Rogers semilattices of compuatble and generalized computable families, Khutoretskii's theorem for generalized computable families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ideals without minimal elements in Rogers semilattices
• A problem of S. S. Goncharov
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Two existence theorems for computable numerations
• On the cardinality of the upper semilattice of computable enumerations
• On some examples of upper semilattices of computable enumerations
• Two theorems on computable numberings
• On minimal numerations
• Generalized computable universal numberings
• Minimal generalized computable enumerations and high degrees
• Enumeration of families of general recursive functions
• On the structures inside truth-table degrees
• 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 Hyperimmune Sets