Extremal numberings and fixed point theorems

DOI10.1002/MALQ.202200035zbMath1521.03129OpenAlexW4286434485WikidataQ113914309 ScholiaQ113914309MaRDI QIDQ6094162

M. Kh. Fajzrakhmanov

Publication date: 12 September 2023

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.202200035

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Two theorems on minimal generalized computable numberings ⋮ A family with a single minimal but not least numbering ⋮ On Non-principal Arithmetical Numberings and Families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable single-valued numerations
• A problem of S. S. Goncharov
• Index sets of quotient objects of the Post numeration
• Universal generalized computable numberings and hyperimmunity
• Precomplete numberings
• Fixed point theorems for precomplete numberings
• Generalized computable universal numberings
• Minimal generalized computable enumerations and high degrees
• On inseparable pairs
• 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
• The Degrees of Hyperimmune Sets
• Degrees in Which the Recursive Sets are Uniformly Recursive
• On notation for ordinal numbers

This page was built for publication: Extremal numberings and fixed point theorems