A family with a single minimal but not least numbering
From MaRDI portal
Publication:6203338
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 738897 (Why is no real title available?)
- scientific article; zbMATH DE number 1531919 (Why is no real title available?)
- scientific article; zbMATH DE number 1746561 (Why is no real title available?)
- scientific article; zbMATH DE number 4118354 (Why is no real title available?)
- scientific article; zbMATH DE number 871851 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Computable single-valued numerations
- Degree Spectra of Relations on Computable Structures
- Enumeration of families of general recursive functions
- Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets
- Enumerations in computable structure theory
- Extremal numberings and fixed point theorems
- Generalized computable numerations and nontrivial Rogers semilattices
- Minimal generalized computable enumerations and high degrees
- Minimal numerations of positively computable families
- On \(p \)-universal and \(p \)-minimal numberings
- On minimal numerations
- On some examples of upper semilattices of computable enumerations
- Prime models of finite computable dimension
- Some effectively infinite classes of enumerations
- The computable enumerations of families of general recursive functions
- Turing computability. Theory and applications
- 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)
