scientific article; zbMATH DE number 1746561

From MaRDI portal
Publication:4530730





The authors study the algebraic properties of Rogers semilattices. They consider problems of existence of minimal elements, minimal coverings, and ideals without minimal elements. In particular, they prove that the Rogers semilattice of any infinite \(\Sigma_{n+2}^0\)-computable family of sets contains infinitely many minimal elements (Theorem 1); and that if a family \({\mathcal A}\subseteq\Sigma^0_{n+2}\) possesses a \(\Sigma^0_{n+2}\)-computable Friedberg numbering then the Rogers semilattice \({\mathcal R}_{n+2}({\mathcal A})\) contains an ideal without minimal elements.




Cited in
(42)








This page was built for publication:

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