A note on a canonical theory with undecidable unification and matching problem

From MaRDI portal
(Redirected from Publication:1098623)





This research note gives a simple proof of the fact that the unification and matching problem is undecidable in the class of equational theories that can be embedded into a canonical term rewriting system. We present a canonical term rewriting system for integer arithmetic and show that the unification and matching problem in the corresponding equational theory is equivalent to Hilbert's tenth problem which is well known to be undecidable.











This page was built for publication: A note on a canonical theory with undecidable unification and matching problem

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