No CrossRef data available.
Article contents
A decision problem for varieties of commutative semigroups
Published online by Cambridge University Press: 17 April 2009
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1993
References
[1]Benninghofen, B., Kemmerich, S. and Richter, M. M., Systems of reductions (Springer-Verlag, Berlin, Heidelberg, New York, 1987).CrossRefGoogle Scholar
You have
Access