Theories of Rogers semilattices of analytical numberings

DOI10.1134/S1995080221040065zbMath1491.03032OpenAlexW3170271530MaRDI QIDQ2030131

Zh. Tleuliyeva, Nikolay Bazhenov, Manat Mustafa

Publication date: 7 June 2021

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080221040065

zbMATH Keywords

analytical hierarchyupper semilatticeelementary theoryprojective determinacyRogers semilatticetheory of numberings

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numberings in the analytical hierarchy
• On some examples of upper semilattices of computable enumerations
• Elementary theories and hereditary undecidability for semilattices of numberings
• Reductions between types of numberings
• Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
• Elementary Theories for Rogers Semilattices
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Metarecursive sets
• SOME CONSEQUENCES OF THE AXIOM OF DEFINABLE DETERMINATENESS

This page was built for publication: Theories of Rogers semilattices of analytical numberings