Abstract:
It is proved that every Markov property of semigroups finitely presented in a variety given by the identity $x^{r_1}=x^{r_2}$, where $r_1>r_2\geqslant 2$, which a one-element semigroup enjoys, is algorithmically non-recognizable.
Keywords:Burnside variety of semigroups, Markov property, finitely presented semigroup, algorithmic non-recognizability of properties.
Fulltext:
PDF file (176 kB)
