Undecidability of elementary theories of Rogers semilattices on the limit levels of the arithmetical hierarchy
From MaRDI portal
Publication:2895841
zbMATH Open1249.03082MaRDI QIDQ2895841FDOQ2895841
Publication date: 13 July 2012
Published in: Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)
Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Undecidability and degrees of sets of sentences (03D35)
Cited In (4)
- Undecidability of the elementary theory of the semilattice of GLP-words
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- A Uniformly, Extremely Nonextensional Formula of Arithmetic with many Undecidable Fixed Points in many Theories
- Theories of Rogers semilattices of analytical numberings
This page was built for publication: Undecidability of elementary theories of Rogers semilattices on the limit levels of the arithmetical hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895841)
