Abstract

Novikov is one of Russia's leading logicians and the appearance of this fine textbook is a good indicator of increasing American interest in Soviet logic. The book contains some new material, including a new independence proof of the rule of complete induction from the remaining axioms of first-order arithmetic. The first third of this work consists in chapters on propositional algebra and the propositional calculus. The first-order predicate calculus comes next under discussion: here a number of important classical results—Gödel's incompleteness theorem, the Compactness theorem, Skolem-Löwenheim theorem—are proved rigorously. The author throughout the book leans fairly heavily on model-theoretic techniques, hence knowledge of some algebra, especially elementary field theory, will be useful. The last two chapters are concerned with first order arithmetic and the elements of proof theory. The only shortcoming is the lack of a bibliography and related scholarly apparatus; the student using this text may have difficulty locating material in other publications relevant to that in the book without outside assistance. The translation is very smooth and clear. Altogether, a first-class job.—P. J. M.