Trudy Matematicheskogo Instituta imeni V. A. Steklova
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Mat. Inst. Steklova:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


1955, Volume 44  

| General information | Contents | Forward links | Page by page |


On the algorithmic unsolvability of the word problem in group theory


Author: P. S. Novikov



Full text: Contents

Citation: P. S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst. Steklov., 44, Acad. Sci. USSR, Moscow, 1955, 144 pp.
Citation in format AMSBIB:
\Bibitem{1}
\by P.~S.~Novikov
\book On the algorithmic unsolvability of the word problem in group theory
\serial Trudy Mat. Inst. Steklov.
\yr 1955
\vol 44
\publ Acad. Sci. USSR
\publaddr Moscow
\totalpages 144
\mathnet{http://mi.mathnet.ru/book1081}

Linking options:
  • http://mi.mathnet.ru/eng/book1081

  • Review databases:
    Труды Математического института имени В. А. Стеклова Proceedings of the Steklov Institute of Mathematics
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025