On Some Algorithmic Problems Related to Varieties of Nonassociative Rings

V. Yu. Popov

Matematičeskie trudy, Tome 3 (2000) no. 2, pp. 146-170.

Résumé

It is proven that there exists no algorithm deciding whether the variety $\mathrm{var}\Sigma$ is finitely based relative to an arbitrary recursive system of ring identities $\Sigma$. An infinite sequence is constructed of finitely based varieties of nonassociative rings $\mathfrak A_1\supset\mathfrak B_1\supset\mathfrak A_2\supset\mathfrak B_2 \supset\dotsb$ such that, for all $i$, the equational theory of $\mathfrak A_i$ is undecidable and the equational theory of $\mathfrak B_i$ is decidable.