It is well known that whenever a class of structures is interpretable in a class of structures , then the hereditary undecidability of (a fragment of) the theory of implies the hereditary undecidability of (a suitable fragment of) the theory of . In the present paper, we construct a -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 -theory of the second class. Next, we construct a -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 -theory of the second class. The corresponding results are, in a sense, optimal, since the -theories of the classes under consideration are decidable. Keywords: undecidability, elementary theories, prefix fragments

生成讲解博客的中文版本

生成AI智能校验的中文版本