Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
From MaRDI portal
Publication:5741390
DOI10.1007/S10958-016-2857-3zbMATH Open1349.03047OpenAlexW2344505286MaRDI QIDQ5741390FDOQ5741390
Authors: S. S. Ospichev 
Publication date: 22 July 2016
Published in: Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-016-2857-3
Cites Work
- On a hierarchy of sets. III
- Title not available (Why is that?)
- Families without minimal numberings
- Generalized computable numerations and nontrivial Rogers semilattices
- Positive undecidable numberings in the Ershov hierarchy
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- Computability and numberings
- Some properties of the numberings of various classes in the Ershov hierarchy
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Title not available (Why is that?)
- Hierarchy of limiting computations
- Elementary Theories for Rogers Semilattices
- Local structure of Rogers semilattices of Σn 0-computable numberings
- Title not available (Why is that?)
- On the existence of universal numberings for finite families of d.c.e. sets
- Undecidability of elementary theories of Rogers semilattices on the limit levels of the arithmetical hierarchy
- Minimal elements and minimal coverings in the Rogers semilattice of computable numberings in the hyperarithmetical 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)
