论文信息 - The Word Problem of ACD-Ground Theories is Undecidable

The Word Problem of ACD-Ground Theories is Undecidable

We prove that there exists an ACD-ground theory, i.e., an equational theory defined by a set of ground equations plus the associativity and commutativity of two binary symbols * and +, and the distributivity of * over +, for which the word problem is undecidable.

Claude Marché

[1] Reinhard Bündgen. Simulation Buchberger's Algorithm by Knuth-Bendix Completion , 1991, RTA.

[2] Claude Marché,et al. On Ground AC-Completion , 1991, RTA.

[3] H. Keisler,et al. Handbook of mathematical logic , 1977 .

[4] LEO BACHMAIR,et al. Termination Orderings for Associative-Commutative Rewriting Systems , 1985, J. Symb. Comput..

[5] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[6] D. J. Collins,et al. Review: Ju. V. Matijasevic, Sue Walker, Simple Examples of Undecidable Associative Calculi , 1968 .

[7] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[8] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[9] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.