scientific article

zbMath0643.68032MaRDI QIDQ3785922

Erik Tidén

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unification algorithmcollapse-free equational theoriesdisjoint sets of function symbols

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05)

Related Items (12)

Modular higher-order E-unification ⋮ Associative-commutative unification ⋮ The unification hierarchy is undecidable ⋮ Combining matching algorithms: The regular case ⋮ Unification algorithms cannot be combined in polynomial time ⋮ Unification theory ⋮ Combining matching algorithms: The regular case ⋮ Unification in Boolean rings and Abelian groups ⋮ Unification in a combination of arbitrary disjoint equational theories ⋮ Boolean unification - the story so far ⋮ On equational theories, unification, and (un)decidability ⋮ Unification algorithms cannot be combined in polynomial time.

This page was built for publication: