Decidability of the elementary theory of a finitely defined quasigroup (Q920205)

Let G be a finitely presented quasigroup given as \(<A;S>\) where A is a set of generators, S is a set of defining relations. The quasigroup G is considered as \(\Omega\)-algebra of type \(<2,2,2>\) with the signature \(\Omega =\{\cdot,/,\setminus \}\). Let L be a language of first order (with an equality) having the signature \(\Omega\cup A\). The set of all closed formulae of the language L which are true in G is called the elementary theory Th(G) of the quasigroup G. The elementary theory Th(G) is always decidable for finite quasigroups as follows from a paper by \textit{T. Evans} [J. Lond. Math. Soc. 26, 64-71 (1951; Zbl 0042.033)]. In the work under review its decidability for infinite finitely presented quasigroups is proved.