Rogers semilattices with least and greatest elements in the Ershov hierarchy

DOI10.1007/S10469-022-09690-YMaRDI QIDQ2680581zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev, S. 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

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites work

• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Computable numberings in the hierarchy of Ershov
• Computable numberings of families of infinite sets
• Computable structures and the hyperarithmetical hierarchy
• Embeddability of the semilattice L_m^0 in Rogers semilattices
• Families without minimal numberings
• Friedberg numberings in the Ershov hierarchy
• Generalized computable numerations and nontrivial Rogers semilattices
• scientific article; zbMATH DE number 2047498 (Why is no real title available?)
• 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 3291134 (Why is no real title available?)
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• On the cardinality of the upper semilattice of computable enumerations
• On the existence of universal numberings for finite families of d.c.e. sets
• Positive undecidable numberings in the Ershov hierarchy
• Reductions between types of numberings
• Rogers semilattices of families of two embedded sets in the Ershov hierarchy

This page was built for publication: Rogers semilattices with least and greatest elements in the Ershov hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680581)