This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. I. Adyan, “Defining relations and algorithmic problems for groups and semigroups,” Tr. Mat. Inst. Akad. Nauk SSSR,85, 3–123 (1966).
S. I. Adyan and G. U. Oganesyan, “On problems of equality and divisibility in semi-groups with one defining relation,” Izv. Akad. Nauk SSSR, Ser. Mat.,42, No. 2, 219–225 (1978).
Ju. M. Vazenin, “Sur la liaison entre problemes combinatoires et problemes algorithmiques,” Teor. Comput. Sci.,16, 33–41 (1981).
L. M. Shneerson, “Identities in semigroups with one defining relation. II,” Logic, Algebra, and Computational Mathematics, Ivanovo Pedagogical Institute,1, Nos. 3-4, 112–124 (1972).
Sverdlovsk Notebook: Unsolved Problems of Semigroup Theory [in Russian], 2nd ed., Ural Univ. Publ., Sverdlovsk (1979).
Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).
L. M. Shneerson, “Identities in semigroups with one defining relation,” Logic, Algebra, and Computational Mathematics, Ivanovo Pedagogical Institute,1, Nos. 1-2, 139–156 (1972).
Yu. L. Ershov, I. A. Lavrov, A. D. Taimanov, and M. A. Taitslin, “Elementary theories,” Usp. Mat. Nauk,20, No. 4, 37–108 (1965).
Additional information
Ural State University, Sverdlovsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 24, No. 1, pp. 40–49, January–February, 1983.
Rights and permissions
About this article
Cite this article
Vazhenin, Y.M. Semigroups with one defining relation whose elementary theories are solvable. Sib Math J 24, 33–41 (1983). https://doi.org/10.1007/BF00968793
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00968793