Unification types of completely regular semigroups

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


The unification types of completely regular semigroups was discussed. It was shown that a variety V of completely regular semigroups that contained a nontrivial (two-element) semilattice had finitary, infinitary, or unitary unification type if and if only V consisted strong semilattices of rectangular groups of finitary, infinitary or unitary unification type. Analysis showed that the problem of recognizing unification types of varieties of completely regular semigroups that contain nontrival semilattice was decidable if and only if it was decidable for the corresponding varieties of groups.

Original languageEnglish
Pages (from-to)171-182
Number of pages12
JournalJournal of Automated Reasoning
Issue number2
StatePublished - 1 Dec 2002


  • Semigroup
  • Semilattices
  • Unification types

ASJC Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Artificial Intelligence


Dive into the research topics of 'Unification types of completely regular semigroups'. Together they form a unique fingerprint.

Cite this