A decision problem for varieties of commutative semigroups
1993 ◽
Vol 47
(3)
◽
pp. 457-464
Keyword(s):
For a first order formula P: ∀x1, …, ∀xn, ∃y1, …, ∃ym (u(x1, …, xn, y1, …, ym) ≡ v(x1, …, xn, y1, …, ym)) where u and v are two words on the alphabet {x1, …, xn, y1, …, ym}, and a finite set E of semigroup identities with xy ≡ yx in it, we prove that it is decidable whether P follows from E, that is whether all the semigroups in the variety defined by E satisfy P.
2012 ◽
Vol 11
(02)
◽
pp. 307-326
◽
Keyword(s):
Keyword(s):
Keyword(s):
1976 ◽
Vol 41
(2)
◽
pp. 460-464
◽
1987 ◽
Vol 29
(2)
◽
pp. 459-475
◽
Keyword(s):
2011 ◽
Vol 21
(1)
◽
pp. 65-110
◽
Keyword(s):