|
|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
| 1. |
A. G. Dragalin, “Completeness and cut-elimination theorems in higher-order classical logic. Constructive methods”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 3, 3–18    ; Russian Math. (Iz. VUZ), 37:3 (1993), 1–16 |
|
1980 |
| 2. |
A. G. Dragalin, “New forms of realizability and Markov's rule”, Dokl. Akad. Nauk SSSR, 251:3 (1980), 534–537 |
|
1971 |
| 3. |
A. G. Dragalin, V. A. Lyubetskii, V. I. Fukson, “Definable sequences of countable ordinals”, Dokl. Akad. Nauk SSSR, 196:6 (1971), 1263–1265 |
|
1969 |
| 4. |
A. G. Dragalin, “Transfinite complements of the constructive arithmetical calculus”, Dokl. Akad. Nauk SSSR, 189:3 (1969), 458–460 |
| 5. |
A. G. Dragalin, V. A. Lyubetskii, “Construction of an effectively inaccessible cardinal in a natural prolongation of the Zermelo–Fraenkel system”, Dokl. Akad. Nauk SSSR, 187:6 (1969), 1225–1228 |
|
1968 |
| 6. |
A. G. Dragalin, “Word operator algorithms”, Zap. Nauchn. Sem. LOMI, 8 (1968), 46–52 |
| 7. |
A. G. Dragalin, “A computability of primitive recursive terms of finite type and the primitive recursive realization”, Zap. Nauchn. Sem. LOMI, 8 (1968), 32–45 |
|
1967 |
| 8. |
A. G. Dragalin, “On the basis for A. A. Markov's constructive selection principle”, Dokl. Akad. Nauk SSSR, 177:5 (1967), 997–1000 |
| 9. |
A. G. Dragalin, “Constructive transfinite systems and the construction of an algorithm by transfinite induction”, Dokl. Akad. Nauk SSSR, 175:5 (1967), 993–996 |
|
|
|
1974 |
| 10. |
A. G. Dragalin, N. M. Nagornyi, N. V. Petri, N. A. Shanin, “Andrei Andreevich Markov (on his seventieth birthday)”, Uspekhi Mat. Nauk, 29:6(180) (1974), 187–191 ; Russian Math. Surveys, 29:6 (1974), 171–175 |
2
|
| |
|
|
Contact us: