Rogers semilattices of families of two embedded sets in the Ershov hierarchy
From MaRDI portal
Publication:2910992
DOI10.1002/MALQ.201100114zbMATH Open1257.03071OpenAlexW1983032418MaRDI QIDQ2910992FDOQ2910992
Authors: Serikzhan A. Badaev, Andrea Sorbi, Mustafa Manat
Publication date: 12 September 2012
Published in: Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)
Full work available at URL: http://nur.nu.edu.kz/handle/123456789/972
Recommendations
Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)
Cites Work
Cited In (12)
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- On the embedding of the first nonconstructive ordinal in the Rogers semilattices
- The Rogers semilattices of generalized computable enumerations
- Computability and numberings
- Computable numberings in the hierarchy of Ershov
- Reductions between types of numberings
- Title not available (Why is that?)
- The branching theorem and computable categoricity in the Ershov hierarchy
- Lattice properties of Rogers semilattices of compuatble and generalized computable families
- Rogers semilattices with least and greatest elements in the Ershov hierarchy
- Sums of computable ordinals
- Embeddability of the semilattice \(L_m^0\) in Rogers semilattices
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)