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