Minimal generalized computable numberings and families of positive preorders

DOI10.1007/s10469-022-09688-6OpenAlexW4311506783MaRDI QIDQ2680579

F. Rakymzhankyzy, B. S. Kalmurzayev, A. A. Issakhov, Nikolay Bazhenov

Publication date: 4 January 2023

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

Full work available at URL: https://doi.org/10.1007/s10469-022-09688-6

zbMATH Keywords

minimal coverpositive numberingFriedberg numbering\(A\)-computable numberingRogers semilatticepositive linear preorder

Mathematics Subject Classification ID

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

Cites Work

• On weakly pre-complete positive equivalences
• Ideals without minimal elements in Rogers semilattices
• Two existence theorems for computable numerations
• Universal generalized computable numberings and hyperimmunity
• The Rogers semilattices of generalized computable enumerations
• Index sets for classes of positive preorders
• Rogers semilattices for families of equivalence relations in the Ershov hierarchy
• Generalized computable universal numberings
• Weakly precomplete computably enumerable equivalence relations
• 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
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item