Decidability of Unification in the Theor
β
Manfred Schmidt-SchauΓ
π
Article
π
1996
π
Elsevier Science
π
English
β 683 KB
Unification in the equational theory of one-sided distributivity and a multiplicative unit is shown to be decidable. The algorithm is a non-deterministic one that eventually uses a decision algorithm for string unification problems with constant restrictions, which was shown to be decidable by K. Sc