Novikov, Petr Sergeevich
NOVIKOV, PETR SERGEEVICH
(b. Moscow, Russia, 15 August 1901; d. Moscow, 9 January 1975)
mathematics.
Novikov was the son of Sergei Novikov, a merchant in Moscow, and his wife Alexandra. In September 1919 the young Novikov entered the physics and mathematics department of Moscow University. After serving in the Red Army between March 1920 and July 1922, he returned to the university and was graduated in 1925. During the next four years he was a postgraduate student under Nikolai N. Luzin. Subsequently Novikov taught mathematics at the Moscow Chemical Technological Institute, and in 1934 he was invited to join the newly organized Steklov Mathematical Institute. He worked there in the department of real function theory until 1957, when he organized the department of mathematical logic and became its head. In 1935 Novikov received the doctorate in mathematics, and four years later he became a full professor. In 1953 he was elected a corresponding member, and in 1960 a full member, of the Soviet Academy of Sciences.
In 1935 Novikov married Ludmila Vsevolodovna Keldysh, a wellknown mathematician specializing in topology. They had five children. One of their sons, Sergei Petrovich, is president of the Moscow Mathematical Society.
While still a student, Novikov began to work on descriptive set theory. Very soon he became one of the most active members of Luzin’s school of descriptive set theory. In his paper “Sur les fonctions implicites mesurables” (1931) Novikov investigated the problem of whether the equations f_{i}(x̄, ȳ) = 0 and (1≤ i ≤q) with Borel functions f_{i} can implicitly define a Borel function ȳ = f (x̄). He discovered a new method that is referred to as the index comparison principle. Using a generalization of this method, he proved, in his 1935 paper, that for the second projective class of sets the following two separability propositions hold: (1) any two CA_{2}sets are separable by B_{2}sets if they are disjoint; (2) there exist two disjoint A_{2}sets that are nonseparable by B_{2}sets. These propositions unexpectedly turend out to be dual to the known laws for the first projective class.
In his 1938 paper on mathematical physics, Novikov proved that any two solids havings the same constant density must coincide if they both are star—shaped relative to a common point and have the same external gravitational potential. This pioneering result became the basic of many studies by other authors.
In the late 1930’s Novikov began to study mathematical logic and the theory of algorithms. In the paper “On the Consistency of Certain Logical Calculus” (1943), he developed a method of providing the consistency based on a notion of “regularity”. He also, in the same paper, proved the consistency for the formal arithmetic with recursive definitions using this method. In 1951 Novikov proved the consistency of two propositions in the Gödel system Σ of axiomatic set theory : (1) there exists a CAset without perfect subsets; and (2) there exists a B_{2}set that is not Lebesquemeasurable. This proof was based on Gö’s method published in 1940.
The following word problem had been proposed by Max Dehn in 1912 : Let a group G be defined by a finite number of generators and defining relations. For an arbitrary word W in the generators of G, decide in a finite number of steps whether or not W defines the identity element of G.
In 1952 Novikov constructed a finitely defined group H with an unsolvable word problem, that is, a group with no algorithm to solve the word problem for H. This result was first announced in his 1952 paper “Ob algoritmicheskoi nerazreshimosti problemy tozhdestva” (“On the Algorithmic Unsolvability of the Word Problem”). The complete proof was published three years later. In 1957 William W. Boone gave another example of a group with an unsolvable word problem, and therefore this result is called the NovikovBoone theorem. Important corollaries derived from this theorem have suggested that there are many unsolvable algorithmic problems in fundamental branches of classical mathematics. Novikov received the Lenin Prize for this significant achievement in 1957.
Novikov’s last important result, proved jointly with S. I. Adian, was a negative solution of the Burnside problem of periodic groups, proposed in 1902. In 1959 Novikov announced the existence of infinite, finitely generated periodic groups of any given exponent n = ≥ 72. The complete proof of the result for odd exponents n ≥ 4, 381 was published in a joint article in 1968. In my book, The Burnside Problem and Identities in Groups (1979), there is an exposition of the NovikovAdian method for any odd exponent n ≥ 665 and many applications.
The exceptional influence of Novikov on the advancement of mathematics was also due to his lectures at Moscow University and at the Moscow State Teachers Training Institute, where he chaired the department of analysis from 1944 to 1972. He founded a large school in mathematical logic and its applications in the USSR; his book Elements of Mathematical Logic (1959) was the first original textbook on the subject in the country. His second book, Constructive Mathematical Logic from the Point of View of Classical Logic (1977), has exerted a considerable influence on the development of proof theory.
Novikov retired from the State Teachers Training Institute in 1972 and from the Steklov Mathematical Institute in 1973. He was ill for the last three years of his life.
BIBLIOGRAPHY
I. Original Works. Novikov’s works, up to 1968, are listed in Uspekhi matematicheskikh nauk, 26 , no. 5 (1971), 239–241. The most important works are “Sur les fonctions implictes mesurables”, in Fundamenta Mathematicae, 17 (1931), 8–25; “Sur la separabilitè des ensembles projectifs du seconde classe”, ibid., 25 (1935), 459–466; “Obedinstvennosti obratnoi zadachi potentsiala” (“On the Uniqueness of the Inverse Problem of Potential Theory), in Doklady Akademü nauk, 18 (1938), 165–168; “On the Consistency of Certain Logical Calculus”, in Matematicheskii shornik (Recueil mathematique), n.s., 12 (1943), 231–261; “O neprotivorechivosti nekotorych polozhenii deskriptivnoi teorii mnozhestv”, in Trudy Matematicheskoro instituta imeni V. A. Steklova, 38 (1951), 279–316, trans. By Elliott Mendelson as “On the Consistency of Some Propositions of the Descriptive Theory of Sets”, in American Mathematical Society Translations, ser, 2, 29 (1963), 51–89; “Ob algoritmicheskoi nerazreshimosti problemy tozhdestva” (“On the Algorithmic Unsolvability of the Word Problem”), in Doklady Akademü nauk, 85 , no. 4 (1952), 709–712; “Ob algoritmicheskoi nerazreshimosti problemy tozhdestva slov v teorii grupp”, in Trudy Matematicheskogo instituta inteni V. A. Steklova, 44 (1955), 1–144, trans. by K.A. Hirsch as “On the Algorithmic Unsolvability of the Word Problem in Group Theory”, in American Mathematical Society Translations, ser. 2, 9 (1958), 1–122; “O periodicheskikh gruppakh”, in Doklady Akademü nauk, 127 , no. 4 (1959), 749–752, trans. by J.M. Weinstein as “On Periodic Groups”, in American Mathematical Society Translations, ser. 2. 45 (1965), 19–22;Elementy matematicheskoi logiki (Moscow, 1959), trans. by Leo F. Boron as Elements of Mathematical Logic (Edinburgh, 1964); “O bezkonechnykh periodicheskikh gruppach” (“On Infinite Periodic Groups”), in Izevestiia Akademü nauk. serüa matematicheskaia, 32 nos. 1–3 (1968), 212–244, 251–254, 709–731, with S. I. Adian;Constructivnaia matematicheskaia logika s tochki zreniia classicheskoi (“Constructive Mathematical Logic from the Point of View of Classical Logic”), F.A. Kabakov and B.A. Kushner, eds., preface by S. I. Adian (Moscow, 1977); and Izbrannye trudy (“Selected Works”: Moscow 1979).
II. Secondary Literature. S. I. Adian, The Brurnside Problem and Identities in Groups, John Lennox and James Wiegold, trans. (Berlin and New York, 1979); Kurt Gödel, The Consistency of the Axiom of Choice and of the Generalized ContinuumHypothesis with the Axioms of Set Theory, Annals of Mathematics Studies, no. 3 (1940). See also “Petr Sergeevich Novikov”, in Uspekhi matematidheskikh nauk, 26 , no. 5 (1971), 231–241; and Matematicheskaia logika, teoriia algoritmov i teoriia mnozhestv (“Mathematical Logic, the Theory of Algorithms and Set Theory”), S. I. Adian, ed., in Trudy Matematicheskogo instituta imeni V. A. Steklova, 133 (1973), 5–32.
S. I. Adian
Cite this article
Pick a style below, and copy the text for your bibliography.

MLA

Chicago

APA
"Novikov, Petr Sergeevich." Complete Dictionary of Scientific Biography. . Encyclopedia.com. 18 Nov. 2017 <http://www.encyclopedia.com>.
"Novikov, Petr Sergeevich." Complete Dictionary of Scientific Biography. . Encyclopedia.com. (November 18, 2017). http://www.encyclopedia.com/science/dictionariesthesaurusespicturesandpressreleases/novikovpetrsergeevich
"Novikov, Petr Sergeevich." Complete Dictionary of Scientific Biography. . Retrieved November 18, 2017 from Encyclopedia.com: http://www.encyclopedia.com/science/dictionariesthesaurusespicturesandpressreleases/novikovpetrsergeevich
Citation styles
Encyclopedia.com gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).
Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.
Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, Encyclopedia.com cannot guarantee each citation it generates. Therefore, it’s best to use Encyclopedia.com citations as a starting point before checking the style against your school or publication’s requirements and the mostrecent information available at these sites:
Modern Language Association
The Chicago Manual of Style
http://www.chicagomanualofstyle.org/tools_citationguide.html
American Psychological Association
Notes:
 Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most Encyclopedia.com content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
 In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.