Skip to main content

Algorithmically insoluble problems about finitely presented solvable groups, lie, and associative algebras

  • Conference paper
  • First Online:
Groups — Korea 1983

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1098))

  • 346 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Abels, "An example of a finitely presented group", Homological Group Theory (London Math. Soc. Lecture Notes Series No. 36. Cambridge University Press, 1979), pp. 205–211, MR82b:20047.

    Google Scholar 

  2. S.I. Adyan, "Algorithmic unsolvability of problems of recognition of certain properties of groups", Dokl. Akad. Nauk SSSR (N.S.) 103 (1955), pp. 533–535 (Russian), MR18:455.

    MathSciNet  Google Scholar 

  3. S.I. Adyan, "Unsolvability of some algorithmic problems in the theory of groups", Trudy Moskov. Mat. Obšč. 6 (1957), pp. 231–298 (Russian), MR20:2370.

    MathSciNet  Google Scholar 

  4. S.I. Adyan, "Finitely presented groups and algorithms", Dokl. Akad. Nauk SSSR (N.S.) 117 (1957), pp. 9–12 (Russian), MR20:2371.

    MathSciNet  MATH  Google Scholar 

  5. G. Baumslag, "Subgroups of finitely presented metabelian groups", J. Australian Math. Soc. 16 (1973), pp. 98–110, MR48:11324.

    Article  MathSciNet  MATH  Google Scholar 

  6. G. Baumslag, "Subalgebras of finitely presented solvable lie algebras", J. of Alg. 45 (1977), pp. 295–305, MR55:8128.

    Article  MathSciNet  MATH  Google Scholar 

  7. G. Baumslag, W.W. Boone, and B.H. Neumann, "Some unsolvable problems about elements and subgroups of groups", Math. Scand. 7 (1959), pp. 191–201, MR29:1247.

    MathSciNet  MATH  Google Scholar 

  8. G. Baumslag, Frank B. Cannonito C.F. Miller, "Some recognizable properties of solvable groups", Math. Z. 178 (1981), pp. 289–295, MR82k:20061.

    Article  MathSciNet  MATH  Google Scholar 

  9. G. Baumslag, E. Dyer and J.R.J. Groves, "On the internal homology of finitely generated metabelian groups". In preparation.

    Google Scholar 

  10. G. Baumslag, E. Dyer, and C.F. Miller, "On the integral homology of finitely presented groups", Topology 22 (1983), pp. 27–46.

    Article  MathSciNet  MATH  Google Scholar 

  11. G. Baumslag, D. Gildenhuys, and R. Strebel, "Algorithmically insoluble problems about finitely presented solvable groups, lie and associative algebras. I". Submitted for publication to Journal of Pure and Applied Algebra.

    Google Scholar 

  12. G. Baumslag, D. Gildenhuys and R. Strebel, "Algorithmically insoluble problems about finitely presented solvable groups, lie and associative algebras. II". To appear in Journal of Algebra.

    Google Scholar 

  13. G. Baumslag, D. Gildenhuys and R. Strebel, "Algorithmically insoluble problems about finitely presented solvable groups, lie and associative algebras. III". In preparation.

    Google Scholar 

  14. G. Baumslag, D. Gildenhuys and R. Strebel, "Algorithmically insoluble problems about finitely presented solvable groups, lie and associative algebras. IV". In preparation.

    Google Scholar 

  15. G. Baumslag and M.W. Thomson, "On the centres of finitely presented groups". In preparation.

    Google Scholar 

  16. R. Bieri and R. Strebel, "Valuations and finitely presented metabelian groups", Proc. London Math. Soc. (3) 41 (1980), pp. 439–464, MR81j:20080.

    Article  MathSciNet  MATH  Google Scholar 

  17. W.W. Boone, "Certain simple, unsolvable problems of group theory, V., VI", Nederl. Akad. Wetensch. Proc. Ser. A 60 = Indag. Math. 19 (1957), pp. 22–27, 227–232, MR20:5230.

    Article  MathSciNet  MATH  Google Scholar 

  18. A.A. Fridman, "On the relation between the word problem and the conjugacy problem in finitely defined groups", Trudy Moscov. Mat. Obšč. 9 (1960), pp. 329–356, MR31:1195.

    MathSciNet  Google Scholar 

  19. C.McA. Gordon, "Some embedding theorems and undecidability questions for groups". Preprint.

    Google Scholar 

  20. P. Hall, "Finiteness conditions for soluble groups", Proc. London Math. Soc. (3) 4 (1954), pp. 419–436, MR17:344.

    MathSciNet  MATH  Google Scholar 

  21. P. Hall, "On the finiteness of certain soluble groups", Proc. London Math. Soc. (3) 9 (1959), pp. 592–622, MR22:1618.

    MathSciNet  MATH  Google Scholar 

  22. G. Higman, "Subgroups of finitely presented groups", Proc. Roy. Soc. Ser. A 262 (1961), pp. 455–475, MR24:A152.

    Article  MathSciNet  MATH  Google Scholar 

  23. O.G. Kharlampovich, "A finitely presented solvable group with insoluble equality problem", Izv. Akad. Nauk Ser. Mat. 45 (1981), no. 4, pp. 852–873 (Russian), MR82m:20036.

    MathSciNet  MATH  Google Scholar 

  24. G.P. Kukin, "The equality problem and free products of lie algebras and of associative algebras", Sib. Mat. Ž. 24 (1983), no. 2, pp. 85–96 (Russian).

    MathSciNet  MATH  Google Scholar 

  25. A.I. Maltsev, Algorithms and recursive functions (English translation, Walters-Noordhoof, Groningen, Netherlands, 1970), MR41:8233.

    Google Scholar 

  26. C.F. Miller, On group-theoretic decision problems and their classification (Ann. Math. Studies 68, Princeton University Press, 1971), MR46:9147.

    Google Scholar 

  27. M.L. Minsky, "Recursive unsolvability of Post’s problem of "tag" and other topics in the theory of Turing machines", Ann. of Math. 74 (1961), pp. 437–455, MR25:3825.

    Article  MathSciNet  MATH  Google Scholar 

  28. G.A. Noskov, "On the conjugacy problem in metabelian groups", Mat. Zametki 31 (1982), no. 4, pp. 495–507 (Russian), MR83i:20029.

    MathSciNet  MATH  Google Scholar 

  29. P.S. Novikov, "On algorithmic unsolvability of the problem of identity", Dokl. Akad. Nauk SSSR (N.S.) 85 (1952), pp. 709–712 (Russian), MR14:618.

    MathSciNet  Google Scholar 

  30. P.S. Novikov, On the algorithmic unsolvability of the word problem in group theory (Trudy Mat. Inst. im. Steklov. No. 44, Izdat. Akad. Nauk, SSSR, Moscow, 1955) (Russian), MR17:706.

    Google Scholar 

  31. Michael O. Rabin, "Recursive unsolvability of group theoretic problems", Bull. Amer. Math. Soc. 62 (1956), p. 396.

    MathSciNet  Google Scholar 

  32. Michael O. Rabin, "Recursive unsolvability of group theoretic problems", Ann. of Math. (2) 67 (1958), pp. 172–194, MR22:1611.

    Article  MathSciNet  MATH  Google Scholar 

  33. V.N. Remeslennikov, "A finitely presented group whose center is not finitely generated", Alg. i Logika 13 (1974), no. 4, pp. 450–459 (Russian), MR52:14064.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ann Chi Kim Bernhard H. Neumann

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Baumslag, G. (1984). Algorithmically insoluble problems about finitely presented solvable groups, lie, and associative algebras. In: Kim, A.C., Neumann, B.H. (eds) Groups — Korea 1983. Lecture Notes in Mathematics, vol 1098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099656

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13890-7

  • Online ISBN: 978-3-540-39102-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics