Hostname: page-component-5b777bbd6c-v47t2 Total loading time: 0 Render date: 2025-06-26T05:26:44.163Z Has data issue: false hasContentIssue false
  • English
  • Français

P. S. Novikov. Ob algoritmičéskoj nérazréšimosti problémy toždéstva slov v téorii grupp (Algorithmic unsolvability of the word problem in group theory). Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 44. Izdatél'stvo Akadémii Nauk SSSR, Moscow1955, 143 pp.

Published online by Cambridge University Press:  12 March 2014

J. L. Britton
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 23 , Issue 1 , March 1958 , pp. 50 - 52
Copyright
Copyright © Association for Symbolic Logic 1958

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable