|
|
Publications in Math-Net.Ru
-
A constructive model of classical formal arithmetic
Dokl. Akad. Nauk, 332:1 (1993), 26–28
-
On realizable and fulfillable logical-arithmetical formulae
Dokl. Akad. Nauk SSSR, 157:3 (1964), 529–531
-
The realization of functions in alphabets by algorithms of certain classes
Dokl. Akad. Nauk SSSR, 140:1 (1961), 52–55
-
A minimal alphabet of algorithms over a given alphabet
Trudy Mat. Inst. Steklov., 52 (1958), 66–74
-
Some generalizations of the concept of a normal algorithm
Trudy Mat. Inst. Steklov., 52 (1958), 7–65
-
On the research project “Bibliography of mathematical logic and adjacent fields” of the Department of Mathematical Logic of Geidelberg Academy of Sciences
Zh. Vychisl. Mat. Mat. Fiz., 35:2 (1995), 318–319
-
Einführung in die Mathematische Logik: G. ASSER. Teil I. Aussagenkalkül, vi + 184 pp.; Teil II. Predikatenkalkül der ersten Stufe, v + 190 pp.; B. G. Teubner, Leipzig, 1972. Book review
Zh. Vychisl. Mat. Mat. Fiz., 16:3 (1976), 815–816
-
Aussagenlogik und beweisverfahren: H. Freund, P. Sorger 136 p., B. G. Teubner, Stuttgart, 1974. Book review
Zh. Vychisl. Mat. Mat. Fiz., 16:2 (1976), 535–536
-
Andrei Andreevich Markov (on his seventieth birthday)
Uspekhi Mat. Nauk, 29:6(180) (1974), 187–191
-
A. Zulauf. The logical and set-theoretical foundations of mathematics. Part I. Edinburgh, Oliver and Boyd, 1969, VII+259 pp. (Book review)
Zh. Vychisl. Mat. Mat. Fiz., 11:3 (1971), 793
-
Andrei Andreevich Markov (on his sixtieth birthday)
Uspekhi Mat. Nauk, 19:3(117) (1964), 207–223
© , 2026