arXiv Analytics

Sign in

arXiv:2405.08422 [math.LO]AbstractReferencesReviewsResources

Hereditary undecidability of fragments of some elementary theories

Vladimir E. Karpov

Published 2024-05-14Version 1

It is well known that whenever a class of structures $\mathcal{K}_1$ is interpretable in a class of structures $\mathcal{K}_2$, then the hereditary undecidability of (a fragment of) the theory of $\mathcal{K}_1$ implies the hereditary undecidability of (a suitable fragment of) the theory of $\mathcal{K}_2$. In the present paper, we construct a $\Sigma_1$-interpretation of the class of all finite bipartite graphs in the class of all pairs of equivalence relations on the same finite domain; from this we obtain the hereditary undecidability of the $\Sigma_2$-theory of the second class. Next, we construct a $\Sigma_1$-interpretation of the class of all pairs of equivalence relations on the same finite domain in the class of all pairs consisting of a linear ordering and an equivalence relation on the same finite domain; this gives us the hereditary undecidability of the $\Sigma_2$-theory of the second class. The corresponding results are, in a sense, optimal, since the $\Pi_2$-theories of the classes under consideration are decidable. Keywords: undecidability, elementary theories, prefix fragments

Related articles: Most relevant | Search more
arXiv:1412.4439 [math.LO] (Published 2014-12-15)
On Elementary Theories of GLP-Algebras
arXiv:1601.01487 [math.LO] (Published 2016-01-07)
Incompleteness in the finite domain
arXiv:2003.02238 [math.LO] (Published 2020-03-04)
Equivalence Relations and Determinacy