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

Trudy Matematicheskogo Instituta imeni V. A. Steklova, 1955, Volume 44, Pages 3–143 (Mi tm1180)  
This article is cited in 26 scientific papers (total in 30 papers)

On the algorithmic unsolvability of the word problem in group theory

P. S. Novikov
Full-text PDF (13684 kB) Citations (30)
Bibliographic databases:
Language: Russian
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, 3–143
Citation in format AMSBIB
\Bibitem{Nov55}
\by P.~S.~Novikov
\paper On the algorithmic unsolvability of the word problem in group theory
\serial Trudy Mat. Inst. Steklov.
\yr 1955
\vol 44
\pages 3--143
\publ Acad. Sci. USSR
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tm1180}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=75197}
\zmath{https://zbmath.org/?q=an:0068.01301}
Linking options:
  • https://www.mathnet.ru/eng/tm1180
  • https://www.mathnet.ru/eng/tm/v44/p3
    • This publication is cited in the following 30 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Математического института имени В. А. Стеклова Proceedings of the Steklov Institute of Mathematics
    Statistics & downloads:
    Abstract page:3228
    Full-text PDF :1817
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025