Rogers semilattices of families of two embedded sets in the Ershov hierarchy
From MaRDI portal
Publication:2910992
Recommendations
Cites work
Cited in
(12)- Computability and numberings
- Embeddability of the semilattice \(L_m^0\) in Rogers semilattices
- The branching theorem and computable categoricity in the Ershov hierarchy
- scientific article; zbMATH DE number 1746561 (Why is no real title available?)
- Sums of computable ordinals
- Rogers semilattices with least and greatest elements in the Ershov hierarchy
- On the embedding of the first nonconstructive ordinal in the Rogers semilattices
- The Rogers semilattices of generalized computable enumerations
- Reductions between types of numberings
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- Computable numberings in the hierarchy of Ershov
- Lattice properties of Rogers semilattices of compuatble and generalized computable families
This page was built for publication: Rogers semilattices of families of two embedded sets in the Ershov hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910992)