Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
From MaRDI portal
Publication:5741390
Cites work
- scientific article; zbMATH DE number 1746561 (Why is no real title available?)
- scientific article; zbMATH DE number 2167508 (Why is no real title available?)
- scientific article; zbMATH DE number 1873436 (Why is no real title available?)
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
- Computability and numberings
- Elementary Theories for Rogers Semilattices
- Families without minimal numberings
- Generalized computable numerations and nontrivial Rogers semilattices
- Hierarchy of limiting computations
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- Local structure of Rogers semilattices of Σn 0-computable numberings
- Minimal elements and minimal coverings in the Rogers semilattice of computable numberings in the hyperarithmetical hierarchy
- On a hierarchy of sets. III
- On the existence of universal numberings for finite families of d.c.e. sets
- Positive undecidable numberings in the Ershov hierarchy
- Some properties of the numberings of various classes in the Ershov hierarchy
- Undecidability of elementary theories of Rogers semilattices on the limit levels of the arithmetical hierarchy
Cited in
(3)
This page was built for publication: Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741390)
