Some independence results for equational unification
From MaRDI portal
Publication:5055843
Recommendations
- Equational unification, word unification, and 2nd-order equational unification
- Some results on equational unification
- Single versus simultaneous equational unification and equational unification for variable-permuting theories
- The undecidability of the unification and matching problem for canonical theories
- scientific article; zbMATH DE number 1222419
Cites work
- scientific article; zbMATH DE number 4155899 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- A unification algorithm for second-order monadic terms
- Makanin's algorithm for word equations-two improvements and a generalization
- Matching - a special case of unification?
- On two problems related to cancellativity
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
- Some results on equational unification
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- The undecidability of the second-order unification problem
Cited in
(4)
This page was built for publication: Some independence results for equational unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055843)