Is it decidable if a finite set of identities imply the commutative identity?

64 Views Asked by At

This is a follow-up to my previous question, here: Is it decidable if a finite set of equations have only trivial models?. Let our signature be that of a single binary operation symbol $*$. Suppose I am given a finite set $S$ of identities in that signature, and I want to know whether the set $S$ implies the commutative identity $x*y=y*x$. Is that a decidable problem?