Skip to main content
SpringerLink
Log in

Some algorithmic problems for solvable groups

  • Published:
Algebra and Logic Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. P. S. Novikov, "On the algorithmic unsolvability of the identity problem," Dokl. Akad. Nauk SSSR,85, 709–712 (1952).

    Google Scholar 

  2. V. N. Remeslennikov, "An example of a group finitely defined in the variety with an unsolvable equality problem," Algebra i Logika,12, No. 5, 577–602 (1973).

    Google Scholar 

  3. K. A. Mikhailova, "The occurrence problem for free products of groups," Matem. Sb.,75, No. 2, 199–211 (1968).

    Google Scholar 

  4. J. P. Labute, "On the descending central series of groups with a single defining relation," J. Algebra,14, No. 1, 16–23 (1970).

    Article  Google Scholar 

  5. N. S. Romanovskii, "A freeness theorem for groups with a single defining relation in varieties of solvable and nilpotent groups of given classes," Matem. Sb.,89, No. 1, 93–99 (1972).

    Google Scholar 

  6. A. A. Bovdi, "On group rings of torsion-free groups," Sibirsk. Matem. Zh.,1, No. 4, 555–558 (1960).

    Google Scholar 

Download references

Authors
  1. N. S. Romanovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 13, No. 1, pp. 26–34, January–February, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Romanovskii, N.S. Some algorithmic problems for solvable groups. Algebra and Logic 13, 13–16 (1974). https://doi.org/10.1007/BF01462922

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation