|
|
|
Publications in Math-Net.Ru |
Citations |
|
2007 |
| 1. |
A. A. Muchnik, “On $S5$-$T$-$Y$ logic”, Keldysh Institute preprints, 2007, 086, 8 pp.  |
|
1973 |
| 2. |
A. A. Muchnik, A. N. Maslov, “Regular, linear and probabilistic events”, Trudy Mat. Inst. Steklov., 133 (1973), 149–168   ; Proc. Steklov Inst. Math., 133 (1977), 150–168 |
|
1965 |
| 3. |
A. A. Muchnik, “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 |
|
1963 |
| 4. |
A. A. Muchnik, “On strong and weak reducibility of algorithmic problems”, Sibirsk. Mat. Zh., 4:6 (1963), 1328–1341 |
1
|
|
1962 |
| 5. |
A. A. Muchnik, S. G. Gindikin, “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 |
|
1959 |
| 6. |
A. A. Muchnik, “А. А. Мучник–Р. Фридберг. Проблема сводимости перечислимых множеств”, Mat. Pros., Ser. 2, 4 (1959), 233–236 |
|
1958 |
| 7. |
A. A. Muchnik, “Isomorphism of systems of recursively enumerable sets with effective properties”, Tr. Mosk. Mat. Obs., 7 (1958), 407–412 |
2
|
| 8. |
A. A. Muchnik, “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 |
2
|
|
| Organisations |
|
| |
|
|
Contact us: