E. A. Kolmakov, “On a strengthening of the non-isomorphism theorem for provability algebras”, Dokl. Math., 104:1 (2021), 180–183
4.
Evgeny Kolmakov, “Local reflection, definable elements and 1-provability”, Arch. Math. Logic, 59 (2020), 979–996;
5.
E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing provable $n$-provability”, Dokl. Math., 98:3 (2018), 582–585
6.
E. A. Kolmakov, S. S. Marchenkov, “On maximal subgroups of the group of recursive permutations”, Moscow Univ. Comput. Math. Cybernet., 40:3 (2016), 128–132
7.
E. A. Kolmakov, “Metric generalization of classification algorithms based on formal concept analysis”, Comput. Math. Model., 26:4 (2015), 566–576
8.
E. Kolmakov, “Metric Generalization and Modification of Classification Algorithms Based on Formal Concept Analysis”, Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at ECAI 2014), v. 1257, eds. S. Kuznetsov, A. Napoli, S. Rudolph, CEUR Workshop Proceedings, Prague, 2014, 43–50http://ceur-ws.org/Vol-1257/paper5.pdf
Contact us: