Estimating the number of steps that it takes to solve some problems of pattern recognition which admit logical description

V. N. Fomin, Mathematical Theory of Learning Recognizing Systems (Leningr. Gos. Univ., Leningrad, 1976) [in Russian].

Yu. I. Zhuravlev, “On the Algebraic Approach to the Solution of Problems of Recognition and Classification,” in Problemy Kibernetiki (Problems of Cybernetics), Vol. 33 (Nauka, Moscow, 1978), pp. 5–78.

T. M. Kosovskaya and A. I. Timofeev, “On a New Approach to the Formation of Logical Decision Rules in Problems of Recognition,” Vestn. Leningr. Gos. Univ., Ser. 1, No. 8, 22–29 (1985).

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).

J. A. Robinson, “A Machine-Oriented Logic Based on Resolution Principle,” JACM 12(1), 23–41 (1965).

S. C. Kleene, Mathematical Logic (Wiley, New York, 1967; Mir, Moscow, 1973).

Yu. N. Kur’erov, “Conditions of Completeness of Linear Output,” in: Semanticheskie Voprosy Iskusstvennogo Intellekta (Semantic Problems of Artificial Intelligence) (Kiev, 1977), pp. 44–45.