Unification Types of Completely Regular Semigroups

被引：0

作者：

G. Mashevitzky

机构：

[1] Ben Gurion University of the Negev,

来源：

Journal of Automated Reasoning | 2002年 / 29卷

关键词：

semigroup; unification types; semilattices;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We show that a variety V of completely regular semigroups that contains a nontrivial (two-element) semilattice has finitary or unitary unification type if and only if V consists of strong semilattices of rectangular groups of finitary or unitary unification type. We reduce the problem of recognizing unification type of a variety V of completely regular semigroups defined by a homotypical system of identities to the same problem for the variety of all groups of V.

引用

页码：171 / 182

页数：11

共 16 条

[1]

Albert M. H.(1996)Category equivalence preserves unification type Algebra Universalis 36 457-466

[2]

Albert M. H.(1994)Unification in varieties of groups: Nilpotent varieties Canad. J. Math. 46 1135-1149

[3]

Lawrence J.(1995)Free groups and unification in A Illinois J. Math. 39 407-415

[4]

Albert M. H.(1987)A Semigroup Forum 36 127-145

[5]

Patrick D.(1992)Unification in varieties of idempotent semigroups Word Equations and Related Topics 572 210-230

[6]

Baader F.(1998)Unification in varieties of completely regular semigroups J. Algebra 200 246-257

[7]

Baader F.(1984)Unification in commutative semigroups Semigroup Forum 30 67-76

[8]

Kisielewicz A.(1988)On bases of completely simple semigroup identities Semigroup Forum 37 253-264

[9]

Mashevitzky G.(1991)Completely simple and completely o-simple semigroup identities J. Automated Reasoning 7 369-381

[10]

Mashevitzky G.(1972)The unification hierarchy is undecidable Mach. Intelligence 7 227-261

← 1 2 →