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

DOI10.1007/BF00247435zbMath0637.68034OpenAlexW1993563396MaRDI QIDQ1098623

Alexander Bockmayr

Publication date: 1987

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00247435

zbMATH Keywords

undecidabilitymatchingunificationequational theoriescanonical term rewriting system

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Abstract data types; algebraic specification (68Q65)

Related Items (4)

Rewriting, and equational unification: the higher-order cases ⋮ Algebraic and logical aspects of unification ⋮ Model-theoretic aspects of unification ⋮ A semantic approach to order-sorted rewriting

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