Some independence results for equational unification

DOI10.1007/3-540-59200-8_70zbMath1503.68146OpenAlexW2029981683MaRDI QIDQ5055843

Paliath Narendran, Daniel J. Dougherty, Friedrich Otto

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_70

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Equational unification, word unification, and 2nd-order equational unification

Cites Work

• Matching - a special case of unification?
• Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
• On two problems related to cancellativity
• A unification algorithm for second-order monadic terms
• The undecidability of the second-order unification problem
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Makanin's algorithm for word equations-two improvements and a generalization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some independence results for equational unification