A family with a single minimal but not least numbering
From MaRDI portal
Publication:6203338
DOI10.1134/S0037446624020125OpenAlexW4393167132MaRDI QIDQ6203338FDOQ6203338
Authors: Marat Kh. Faizrahmanov 
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
Computability and recursion theory (03Dxx) Model theory (03Cxx) Mathematical logic and foundations (03-XX)
Cites Work
- Title not available (Why is that?)
- Enumerations in computable structure theory
- Turing Computability
- Degree Spectra of Relations on Computable Structures
- The computable enumerations of families of general recursive functions
- Generalized computable numerations and nontrivial Rogers semilattices
- Title not available (Why is that?)
- Computable single-valued numerations
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Title not available (Why is that?)
- On some examples of upper semilattices of computable enumerations
- Enumeration of families of general recursive functions
- Title not available (Why is that?)
- Minimal numerations of positively computable families
- Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets
- Extremal numberings and fixed point theorems
- Some effectively infinite classes of enumerations
- On minimal numerations
- Minimal generalized computable enumerations and high degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \(p \)-universal and \(p \)-minimal numberings
- Title not available (Why is that?)
- Prime models of finite computable dimension
- Two theorems on minimal generalized computable numberings
This page was built for publication: A family with a single minimal but not least numbering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203338)
