Pyotr Novikov

From Wikipedia, the free encyclopedia
(Redirected from Petr Sergeevich Novikov)
P. S. Novikov.

Pyotr Sergeyevich Novikov (Russian: Пётр Серге́евич Но́виков; 28 August 1901, Moscow – 9 January 1975, Moscow) was a Soviet mathematician.

Novikov is known for his work on combinatorial problems in group theory: the word problem for groups, and his progress in the Burnside problem. He was awarded the Lenin Prize in 1957 for proving the undecidability of the word problem in groups.[1]

In 1953, he became a corresponding member of the Academy of Sciences of the Soviet Union. In 1960, he was elected a full member.

He was married to mathematician Lyudmila Keldysh (1904–1976) and raised mathematician Sergei Novikov (born 1938) as his son. Sergei Adian and Albert Muchnik were among his students.

Awards and honors[edit]

See also[edit]

References[edit]

  1. ^ S. I. Adian, Mathematical logic, the theory of algorithms and the theory of sets, AMS Bookstore, 1977, ISBN 0-8218-3033-3, p. 26. (being Novikov's Festschrift on the occasion of his seventieth birthday)

External links[edit]