FUNDAMENTALNAYA
I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2002, VOLUME 8, NUMBER 3, PAGES 829-876

V. Yu. Popov

Abstract

View as HTML
View as gif image
View as LaTeX source

```
There exists finitely based variety of monoids
```$\mathfrak Z$
such that there is no algorithm to decide,
given a recursive system $\Sigma$ of semigroup identities,
whether the variety of monoids given by the system $\Sigma$
in $\mathfrak Z$ is an independently based variety. There is no algorithm
to decide, given an infinite recursive system $\Sigma$ of semigroup
identities, whether the variety of monoids defined by the system $\Sigma$
is a finitely based variety.

All articles are published in Russian.

Main page | Contents of the journal | News | Search |

Location: http://mech.math.msu.su/~fpm/eng/k02/k023/k02313t.htm.

Last modified: February 17, 2003