THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE

DOI10.1142/S0129054192000085zbMATH Open0765.03019OpenAlexW2116286831MaRDI QIDQ4020283FDOQ4020283

Authors: Claude Marché 

Publication date: 16 January 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054192000085

Recommendations

• The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
• On ground AC-completion
• On a connection between the word problem and decidability of the equational theory
• A decidable word problem without equivalent canonical term rewriting system
• scientific article; zbMATH DE number 1123898

zbMATH Keywords

equational theoryground equations

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25) Word problems (aspects of algebraic structures) (08A50) Word problems, etc. in computability and recursion theory (03D40)

Cited In (3)

• The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
• A rewriting approach to satisfiability procedures.
• On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus

This page was built for publication: THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020283)