THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE

DOI10.1142/S0129054192000085zbMath0765.03019OpenAlexW2116286831MaRDI QIDQ4020283

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

zbMATH Keywords

equational theoryground equations

Mathematics Subject Classification ID

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

Related Items (2)

On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus ⋮ A rewriting approach to satisfiability procedures.

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