In the eleven chapters of this textbook, the authors deal with the following subjects: Boolean functions and Boolean formulas; minimization of disjunctive and conjunctive normal forms; Post’s functional completeness theorem; first-order predicate logic (FOPL); Novikov’s axiomatic system; Gentzen’s natural deduction (in Yanov’s version); resolution method for Boolean formulas and FOPL formulas; programming language Prolog (Arity-Prolog); partial recursive functions; recursively enumerable and decidable sets; Turing machines; some other definitions of algorithm; Gödel’s incompleteness theorem; programming language LISP.
Reviewer: Alex Nabebin (Moskva)