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