Publications

Articles

• Complexity of the problem of ∀-representation for sentences, Algebra and Logic, 62, No. 4 (2023), 372–375.
• Systems of Diophantine equations over finite configurations, Sib. Math. J., 64, No. 2 (2023), 325–337.
• Complexity of the problem of being equivalent to Horn formulas. II, Algebra and Logic, 61, No. 4 (2022), 318–327.
• Complexity of the problem of being equivalent to Horn formulas, Algebra and Logic, 60, No. 6 (2021), 380–388.
• On closure of configurations in freely generated projective planes, Siberian Elect. Math. Reports, 18, No. 1 (2021), 358–368.
• On the ∀∃-theories of free projective planes, Sib. Math. J., 61, No. 1 (2020), 95–108.
• Complexity of the isomorphism problem for computable free projective planes of finite rank, Sib. Math. J., 59, No. 2 (2018), 295–308.
• The embedding problem for computable projective planes, Algebra and Logic, 56, No. 1 (2017), 75–79.
• Freely generated projective planes with finite computable dimension, Algebra and Logic, 55, No. 6 (2016), 461–484.
• ∏¹₁-completeness of the computable categoricity problem for projective planes, Algebra and Logic, 55, No. 4 (2016), 283–288.
• The theory of projective planes is complete with respect to degree spectra and effective dimensions, Algebra and Logic, 54, No. 5 (2015), 387–407.
• Complexity of isomorphism problem for computable projective planes, J. Math. Sci., 203, No. 4 (2014), 509–515.
• On automatic presentations of projective planes (with A.S. Denisenko), Sib. Math. J., 55, No. 1 (2014), 53–62.
• Noncomputability of classes of pappian and desarguesian projective planes, Sib. Math. J., 54, No. 2 (2013), 247–255.
• Computable dimensions of pappian and desarguesian projective planes, Algebra and Logic, 51, No. 1 (2012), 41–55.
• Undecidability of the theory of projective planes, Algebra and Logic, 49, No. 1 (2010), 1–11.
• The class of projective planes is noncomputable, Algebra and Logic, 47, No. 4 (2008), 242–257.
• On Σ⁰₁-classification of relations on computable structures (with S.S. Goncharov), Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8, No. 4 (2008), 23–32 (in Russian).
• Complexity of some natural problems on the class of computable I-algebras, Sib. Math. J., 47, No. 2 (2006), 291–297.
• The computable dimension of I-trees of infinite height (with O.V. Kudinov and R. Miller), Algebra and Logic, 43, No. 6 (2004), 393–407.
• Universal numbering for constructive I-algebras, Algebra and Logic, 40, No. 5 (2001), 315–326.
• On computable numberings of constructive I-algebras, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 1, No. 1 (2001), 54–66 (in Russian).
• Universal numbering of computable Boolean algebras with distinguished ideal, Vychisl. Sistemy, No. 165, Strukt. i Slozhnostnye Probl. Vychislimosti (1999), 139–152 (in Russian).
• Autostability of Boolean algebras with distinguished ideal, Sib. Math. J., 39, No. 5 (1998), 927–935.

Textbooks

• Discrete mathematics and theory of algorithms, Novosib. Gos. Univ., Novosibirsk, 2023, 126 p. (in Russian) (.pdf) (online version in the electronic library of NSU)
• Lectures on theory of algorithms, Novosib. Gos. Univ., Novosibirsk, 2009, 107 p. (in Russian) (.pdf) (online version in the electronic library of NSU)