Undecidability of the theory of the lattice L^ 0_sm

DOI10.1007/BF00970074MaRDI QIDQ2277449zbMATH OpenOpenAlexFDO

Authors T. V. Rybina

Publication date 1990

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00970074

zbMATH Keywords

undecidable theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45)

Review text

The lattice \(L^ 0_{sm}\) was defined by \textit{Yu. L. Ershov} [Theory of numerations (Russian) (Moscow, Nauka, 1977)]. The author proves by means of the relatively elementary definability method that the elementary theory of this lattice is hereditarily undecidable.

Recommendations

• The undecidability of the elementary theory of lattices of all equational theories of large signature
• Some undecidability results for lattices in recursion theory
• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• A simple proof of the hereditary undecidability of the theory of lattice- ordered Abelian groups
• The undecidability of the lattice of r. e. closed subsets of an effective topological space

Cited in

(5)

• A simple proof of the hereditary undecidability of the theory of lattice- ordered Abelian groups
• On universal pairs in the Ershov hierarchy
• The undecidability of the elementary theory of lattices of all equational theories of large signature
• scientific article; zbMATH DE number 3966058 (Why is no real title available?)
• scientific article; zbMATH DE number 6829362 (Why is no real title available?)

This page was built for publication: Undecidability of the theory of the lattice \(L^ 0_{sm}\)

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