Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1975: Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 pp 432–438Cite as

On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 32))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Higman, G., Subgroups of finitely presented groups. Proc. Roy. Soc., Ser. A 262(1961), 455–475.

    Google Scholar 

  2. Clapham, C.R.J., Finitely presented groups with word problems of arbitrary degrees of unsolvability. Proc. Lond. Math. Soc., XIV(1964) 633–676.

    Google Scholar 

  3. Clapham, C.R.J., An embedding theorem for finitely generated groups. Proc. Lond. Math. Soc., XVII(1967), 419–430.

    Google Scholar 

  4. Gatterdam, R.W., Embeddings of primitive recursive computable groups, doctoral diss., Univ. of California, Irvine, 1970.

    Google Scholar 

  5. Gatterdam, R.W., The computability of group constructions II. Bull. Austr. Math. Soc., 8(1973), 27–60.

    Google Scholar 

  6. Grzegorczyk, A., Some classes of recursive functions. Rozprawy Math., 4(1953), 1–46.

    Google Scholar 

  7. Valiev, M.K., On complexity of word problem for finitely presented groups. Algebra and logic, 8(1969), 5–43.

    Google Scholar 

  8. Valiev, M.K., One theorem of G. Higman. Algebra and logic, 7(1968), 9–22.

    Google Scholar 

  9. Trachtenbrot, B.A., On the complexity of reduction algorithms in Novikov-Boone constructions. Algebra and logic, 8(1969), 93–128.

    Google Scholar 

  10. Matijasevic, Ju.V., Enumerable sets are Diofantine. Dokl. Akad. Nauk SSSR, 191(1970), 279–282.

    Google Scholar 

  11. Britton, J.L., The word problem. Ann. Math. 77(1963), 16–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Novosibirsk 90, USSR

    M. K. Valiev

Authors
  1. M. K. Valiev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valiev, M.K. (1975). On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_229

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_229

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation