Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
A complete algorithm for terms involving idempotent an idempotent-commutative functions is presented. The main results are: The unification problem for both cases is decidable and the set of unifiers is finite for both problems.