Skip to main content
Log in

Algorithmic dimension of nilpotent groups

  • 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. S. S. Goncharov, “Groups with finitely many constructivizations,” Dokl. Akad. Nauk SSSR,256, No. 2 (1980), pp. 269–272.

    Google Scholar 

  2. S. S. Goncharov, “Self-stability of models and abelian groups,” Algebra Logika,19, No. 1, (1980), pp. 23–44.

    Google Scholar 

  3. A. T. Nurtazin, “Computable enumerations of classes and algebraic criteria for selfstability,” Author's Abstract of Candidate's Dissertation Fiz.-Mat. Nauk, Alma-Ata (1974).

  4. Yu. L. Ershov, The Solvability Problem and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  5. M. I. Kargapolov and Yu. I. Merzlyakov, The Foundations of Group, Theory [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  6. H. Neumann, Varieties of Groups [Russian translation], Mir, Moscow (1969).

    Google Scholar 

Download references

Authors

Additional information

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 30, pp. 52–60, March–April, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goncharov, S.S., Drobotun, B.N. Algorithmic dimension of nilpotent groups. Sib Math J 30, 210–217 (1989). https://doi.org/10.1007/BF00971375

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation