We claim that the reduction of Post’s Correspondence Problem to the decision problem of a theory provides a useful tool for proving undecidability of first order theories given by an interpretation. The goal of this paper is to propose a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo AC and the theory of a partial lexicographic path ordering.
CITATION STYLE
Treinen, R. (1990). A new method for undecidability proofs of first order theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 472 LNCS, pp. 48–62). Springer Verlag. https://doi.org/10.1007/3-540-53487-3_34
Mendeley helps you to discover research relevant for your work.