The Complexity of the Word Problem for Abelian l-Groups

Volker Weispfenning. The Complexity of the Word Problem for Abelian l-Groups. Theoretical Computer Science, 48(3):127-132, 1986.

Abstract

Abstract is missing.