Elementary theories and hereditary undecidability for semilattices of numberings

DOI10.1007/s00153-018-0647-yzbMath1477.03168OpenAlexW2893282143MaRDI QIDQ1734277

Manat Mustafa, Nikolay Bazhenov, M. M. Yamaleev

Publication date: 27 March 2019

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-018-0647-y

zbMATH Keywords

computability theoryelementary definabilitynumbering theoryupper semilatticefirst order arithmetichereditary undecidabilitysecond order arithmeticRogers semilatticecomputably enumerable equivalence relation

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items

Rogers semilattices of punctual numberings ⋮ Theories of Rogers semilattices of analytical numberings

Cites Work

• Some undecidability results for lattices in recursion theory
• On computability with functionals
• Computable structures and the hyperarithmetical hierarchy
• Undecidable fragments of elementary theories
• The last question on recursively enumerable \(m\)-degrees
• Reductions between types of numberings
• On a hierarchy of sets. III
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A note on hereditarily Π10- and Σ10-complete sets of sentences
• A Survey on Universal Computably Enumerable Equivalence Relations
• Elementary Theories for Rogers Semilattices
• Recursively Enumerable Equivalence Relations Modulo Finite Differences
• Creative sets
• Computably enumerable equivalence relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item