Two theorems on minimal generalized computable numberings

DOI10.3103/S0027132223030026OpenAlexW4385934177WikidataQ121610684 ScholiaQ121610684MaRDI QIDQ6052274

M. Kh. Fajzrakhmanov

Publication date: 21 September 2023

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132223030026

zbMATH Keywords

low setcomputably enumerable setpositive numberingminimal numbering

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

A family with a single minimal but not least numbering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable single-valued numerations
• On some examples of upper semilattices of computable enumerations
• Existence of families without positive numerations
• Positive enumerations
• The Rogers semilattices of generalized computable enumerations
• On minimal numerations
• Generalized computable universal numberings
• Minimal generalized computable enumerations and high degrees
• Enumeration of families of general recursive functions
• Reduction of computable and potentially comutable numerations
• Enumerations in computable structure theory
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• CONSTRUCTIVE ALGEBRAS I
• Local structure of Rogers semilattices of Σn 0-computable numberings
• [Russian Text Ignored]
• Extremal numberings and fixed point theorems

This page was built for publication: Two theorems on minimal generalized computable numberings