of the paper by S. Maslov "An invertible sequential version of the constructive predicate caculus".

of the paper by J.M. Barzdyn "Complexity of programs which recognize whether natural numbers not exceeding n belong to a recursively enumerable set".

of the paper by O.B. Lupanov "On the question of realization of symmetric functions of the algebra of logic by contact schemes".

of the paper by N.V. Petri "Complexity of algorithms and their operation time".

of the paper by E.Orlovskaya "Automatic theorem proving in a certain class of formulae of predicate calculus".

of the paper by K.Dapp "Uber die Homogenisierbarkeit von Rechenprogrammen".

of the paper by P.Danilenko and V.Umanskiy "A certain algorithm for optimal choice of logical operations in the design of digital systems".

of the paper by A.M. Bogomolov "Two logical schemes for comparational code-generating method"