|
|
Publications in Math-Net.Ru
-
On $S5$-$T$-$Y$ logic
Keldysh Institute preprints, 2007, 086, 8 pp.
-
Regular, linear and probabilistic events
Trudy Mat. Inst. Steklov., 133 (1973), 149–168
-
On the reducibility of problems of the solvability of enumerable sets to problems of separability
Izv. Akad. Nauk SSSR Ser. Mat., 29:3 (1965), 717–724
-
On strong and weak reducibility of algorithmic problems
Sibirsk. Mat. Zh., 4:6 (1963), 1328–1341
-
The completeness of a system of unreliable elements realizing the functions of an algebra of logic
Dokl. Akad. Nauk SSSR, 144:5 (1962), 1007–1010
-
А. А. Мучник–Р. Фридберг. Проблема сводимости перечислимых множеств
Mat. Pros., Ser. 2, 4 (1959), 233–236
-
Isomorphism of systems of recursively enumerable sets with effective properties
Tr. Mosk. Mat. Obs., 7 (1958), 407–412
-
Solution of Post's reduction problem and of certain other problems in the theory of algorithms. I
Tr. Mosk. Mat. Obs., 7 (1958), 391–405
-
Неразрешимость проблемы сводимости теории алгоритмов
Dokl. Akad. Nauk SSSR, 108:2 (1956), 194–197
© , 2026