A family with a single minimal but not least numbering

DOI10.1134/S0037446624020125OpenAlexW4393167132MaRDI QIDQ6203338

M. Kh. Fajzrakhmanov

Publication date: 27 March 2024

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

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

zbMATH Keywords

computable numberingminimal numberingdiscrete familycomputable family

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable single-valued numerations
• Some effectively infinite classes of enumerations
• On some examples of upper semilattices of computable enumerations
• The computable enumerations of families of general recursive functions
• Minimal numerations of positively computable families
• On minimal numerations
• On \(p \)-universal and \(p \)-minimal numberings
• Minimal generalized computable enumerations and high degrees
• Enumeration of families of general recursive functions
• Enumerations in computable structure theory
• Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets
• Turing Computability
• Prime models of finite computable dimension
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Degree Spectra of Relations on Computable Structures
• Two theorems on minimal generalized computable numberings
• Extremal numberings and fixed point theorems

This page was built for publication: A family with a single minimal but not least numbering