Undecidability of elementary theories of Rogers semilattices of analytical hierarchies

DOI10.17377/SEMI.2016.13.013MaRDI QIDQ2630488zbMATH OpenFDO

Authors M. V. Dorzhieva

Publication date 28 July 2016

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

computable numberingsanalytical hierarchyRogers semilatticesminimal numberings

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Theories of Rogers semilattices of analytical numberings
• Elementary theories and hereditary undecidability for semilattices of numberings
• scientific article; zbMATH DE number 535104
• Undecidability in Some Structures Related to Computation Theory
• A Useful Undecidable Theory

Cited in

(9)

• Numberings in the analytical hierarchy
• Elementary theories and hereditary undecidability for semilattices of numberings
• On universal pairs in the Ershov hierarchy
• UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
• Theories of Rogers semilattices of analytical numberings
• Computable positive and Friedberg numberings in hyperarithmetic
• A Useful Undecidable Theory
• Partial decidable presentations in hyperarithmetic
• On the limit property of the greatest element in the Rogers semilattice

This page was built for publication: Undecidability of elementary theories of Rogers semilattices of analytical hierarchies

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