Hereditary undecidability of fragments of some elementary theories
Vladimir E. Karpov

TL;DR
This paper demonstrates hereditary undecidability results for certain fragments of elementary theories by constructing interpretations between classes of finite structures, showing how undecidability propagates through these interpretations.
Contribution
It constructs specific interpretations between classes of finite structures to establish hereditary undecidability of certain theory fragments, revealing optimal decidability boundaries.
Findings
Hereditary undecidability of the $ ext{Σ}_2$-theory of pairs of equivalence relations
Hereditary undecidability of the $ ext{Σ}_2$-theory of pairs of a linear order and an equivalence relation
Decidability of the $ ext{Π}_2$-theories of the classes considered
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms
