Skip to main content
Log in

Some algorithmic problems for finitely defined commutative semigroups

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. V. A. Emelichev, Commutative Semigroups with One Defining Relation, Uch. zap. Shuiskogo ped. in-ta, Vol. VI. 227–242 (1958).

    Google Scholar 

  2. A. I. Mal'tsev, On Homomorphisms of Finite Groups, Uch. zap. Ivanovskogo ped. in-ta, Vol. 18, 49–60 (1958).

    Google Scholar 

  3. L. Rédei, Theorie der Endlich Erzeugbaren Commutativen Halbgruppen, Leipzig (1963).

  4. E. S. Lyapin, Semigroups, [in Russian], Fizmatgiz, Moscow (1960).

    Google Scholar 

  5. Marshall Hall, Theory of Groups [Russian translation], IL, Moscow (1962).

    Google Scholar 

  6. T. S. Motskin, H. Raiffa, G. L. Thomson, and R. M. Troll, The Method of Dual Description, In: Matrix Games [Russian translation], Fizmatgiz, Moscow, 81–109 (1961).

    Google Scholar 

Download references

Authors

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 8, No. 3, pp. 525–534, May–June, 1967.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Biryukov, A.P. Some algorithmic problems for finitely defined commutative semigroups. Soviet Mathematical Journal 8, 384–391 (1967). https://doi.org/10.1007/BF02196421

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02196421

Keywords

Navigation