Complexity of linear standard theories
From MaRDI portal
Recommendations
- Decidability and complexity of finitely closable linear equational theories
- Some results on equational unification
- scientific article; zbMATH DE number 4016225
- Combining unification algorithms
- Single versus simultaneous equational unification and equational unification for variable-permuting theories
This page was built for publication: Complexity of linear standard theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996162)