Rogers, Hartley, Jr. Theory of Recursive Functions and Effective Computability (Teoriya rekursivnykh funktsii i effektivnaya vychislimost'). 1972. First Russian edition.

Роджерс, Х. Теория рекурсивных функций и эффективная вычислимость / перевод с английского В. А. Душского, М. И. Кановича, Е. Ю. Ногиной ; под редакцией В. А. Успенского.
Москва : издательство "Мир", 1972. 624 страницы ; 22 см.
Твердый переплет.
Переплет хорошее: потертость тканевого покрытия у нижнего торца корешка, уголки слегка потерты. Блок хорошее: крепкий, текст полный.
***
Rogers, Hartley, Jr. Theory of Recursive Functions and Effective Computability / translated from the English by V. A. Dushsky, M. I. Kanovich, and E. Yu. Nogina ; edited by V. A. Uspensky. First Russian edition.
Moscow : Mir Publishing House, 1972. 624 pp. ; 22 cm.
Hardcover.
Binding good: wear to the cloth covering at the lower spine tail, corners lightly rubbed. Text block good: firm, text complete.

The first Russian edition of Hartley Rogers's landmark 1967 monograph, still regarded as one of the two or three foundational texts of computability theory alongside the work of Kleene and Soare. Rogers, a professor of mathematics at MIT, produced in the original English text an encyclopedic synthesis of recursive function theory from its origins in the 1930s work of Church, Turing, and Kleene through the state of the art of the mid-1960s, covering degrees of unsolvability, the arithmetical and analytical hierarchies, recursively enumerable sets, and the lattice of recursively enumerable sets with a completeness of coverage the translator's preface explicitly notes has no equal in the world literature on computable functions. The present Soviet translation, issued by the physics and mathematics imprint Mir only five years after the American original, was edited by Vladimir Andreevich Uspensky, the principal founder of the Soviet school of mathematical logic and algorithm theory and author of the earlier standard Russian text "Lektsii o vychislimykh funktsiyakh" (1960); Uspensky's editorial preface situates Rogers's book within the broader Soviet tradition of recursion theory associated with Mal'tsev and Ershov. The translation team included Mikhail Kanovich, who went on to a distinguished career in mathematical logic and linear logic. This edition served as the standard Russian-language reference for graduate study in mathematical logic and the theory of algorithms throughout the late Soviet period and remains cited in current university reading lists in the field. Given the continuing centrality of the English original to the history of computer science and computability theory, the Russian translation is of particular interest to historians of Soviet mathematics and collectors documenting the transmission of Western mathematical logic into the USSR during the Cold War period.