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

DOI10.1007/BF00247435MaRDI QIDQ1098623zbMATH OpenOpenAlexFDO

Authors 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

matchingundecidabilityunificationequational theoriescanonical term rewriting system

Mathematics Subject Classification ID

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

Recommendations

• The undecidability of the unification and matching problem for canonical theories
• On equational theories, unification, and (un)decidability
• The undecidability of the D_A-unification problem
• A remark on infinite matching vs infinite unification
• Unification in permutative equational theories is undecidable
• On unification: Equational theories are not bounded
• scientific article; zbMATH DE number 4041328
• The undecidability of the semi-unification problem
• Unification problem in equational theories
• On the undecidability of second-order unification

Cited in

(7)

• A semantic approach to order-sorted rewriting
• Rewriting, and equational unification: the higher-order cases
• The undecidability of the semi-unification problem
• Unification in permutative equational theories is undecidable
• Algebraic and logical aspects of unification
• Model-theoretic aspects of unification
• The undecidability of the unification and matching problem for canonical theories

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)