Rogers semilattices with least and greatest elements in the Ershov hierarchy
From MaRDI portal
Publication:2680581
DOI10.1007/S10469-022-09690-YOpenAlexW4311211855MaRDI QIDQ2680581
S. A. Badaev, Sergei S. Goncharov
Publication date: 4 January 2023
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-022-09690-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive undecidable numberings in the Ershov hierarchy
- On the cardinality of the upper semilattice of computable enumerations
- Computable structures and the hyperarithmetical hierarchy
- Computable numberings of families of infinite sets
- Reductions between types of numberings
- Families without minimal numberings
- Embeddability of the semilattice \(L_m^0\) in Rogers semilattices
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- On the existence of universal numberings for finite families of d.c.e. sets
- Friedberg numberings in the Ershov hierarchy
This page was built for publication: Rogers semilattices with least and greatest elements in the Ershov hierarchy