|
|
Publications in Math-Net.Ru
-
Additive representations of numbers: some remarks
Program Systems: Theory and Applications, 8:4 (2017), 101–115
-
Using overflows to control parallel and distributed computations
Program Systems: Theory and Applications, 8:3 (2017), 87–107
-
Local computations in system theory and VLDB
Program Systems: Theory and Applications, 7:4 (2016), 145–160
-
Rational agents as probabilistic automata
Program Systems: Theory and Applications, 6:1 (2015), 99–108
-
New representation of real numbers
Program Systems: Theory and Applications, 5:4 (2014), 105–121
-
Algebra icapproac to control
Probl. Upr., 2013, no. 6, 2–14
-
Рефлексирующие программные системы
Sib. Zh. Ind. Mat., 4:1 (2001), 22–28
-
Semantics of algorithmic languages
Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 20 (1983), 95–166
-
Some possibilities for the application of constructive analysis to classical analysis
Dokl. Akad. Nauk SSSR, 266:2 (1982), 284–287
-
On the theory of program synthesis
Trudy Inst. Mat. Sib. Otd. AN SSSR, 2 (1982), 159–175
-
A relation between the natural deduction rules and operators of higher level algorithmic languages
Dokl. Akad. Nauk SSSR, 239:3 (1978), 526–529
-
The language $\Delta$ with intuitionistic connectives
Dokl. Akad. Nauk SSSR, 220:1 (1975), 41–43
-
The language $\Delta$ with weak three-valued logic
Dokl. Akad. Nauk SSSR, 219:6 (1974), 1325–1327
-
A certain generalization of the Kleene–Mostowski hierarchy
Dokl. Akad. Nauk SSSR, 212:2 (1973), 295–297
-
The relation between predicative significance and the intuition of generality
Dokl. Akad. Nauk SSSR, 212:1 (1973), 40–43
-
A new concept of predicative truth and definability
Mat. Zametki, 13:5 (1973), 735–745
-
On embedding Boolean algebras in the Lindenbaum–Tarski algebra
Dokl. Akad. Nauk SSSR, 199:1 (1971), 23–25
-
Mathematician and practitioner: mutual (mis)understanding
Vestn. Udmurtsk. Univ. Mat., 2007, no. 1, 251–268
© , 2024