Hereditary undecidability of fragments of some elementary theories

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…