|
|
|
Publications in Math-Net.Ru |
Citations |
|
1972 |
| 1. |
Yu. T. Medvedev, “Locally finitary algorithmic problems”, Dokl. Akad. Nauk SSSR, 203:2 (1972), 285–288    |
|
1969 |
| 2. |
Yu. T. Medvedev, “A certain method of proof of unsolvability of algorithmic problems”, Dokl. Akad. Nauk SSSR, 185:6 (1969), 1232–1235 |
|
1966 |
| 3. |
Yu. T. Medvedev, “Interpretation of logical formulas by means of finite problems”, Dokl. Akad. Nauk SSSR, 169:1 (1966), 20–23 |
3
|
|
1963 |
| 4. |
Yu. T. Medvedev, “Interpretation of logical formulae by finite problems and its relation to the theory of realizability”, Dokl. Akad. Nauk SSSR, 148:4 (1963), 771–774 |
2
|
|
1962 |
| 5. |
Yu. T. Medvedev, “Finitive problems”, Dokl. Akad. Nauk SSSR, 142:5 (1962), 1015–1018 |
9
|
|
1953 |
| 6. |
Yu. T. Medvedev, “Generalization of a theorem of F. Riesz”, Uspekhi Mat. Nauk, 8:6(58) (1953), 115–118 |
3
|
|
|
|
1972 |
| 7. |
Yu. T. Medvedev, “Поправки к статье “Локально-финитные алгоритмические проблемы” (ДАН, т. 203, № 2, 1972 г.)”, Dokl. Akad. Nauk SSSR, 204:6 (1972), 774 |
|
