| Publication | Date of Publication | Type |
|---|
Complexity of the problem of \(\forall \)-representation for sentences
Algebra and Logic | 2024-09-04 | Paper |
Complexity of the problem of being equivalent to Horn formulas. II
Algebra and Logic | 2023-05-10 | Paper |
Systems of Diophantine equations over finite configurations
Siberian Mathematical Journal | 2023-03-30 | Paper |
Complexity of the problem of being equivalent to Horn formulas
Algebra and Logic | 2022-06-15 | Paper |
On closure of configurations in freely generated projective planes
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-06-17 | Paper |
On the \(\forall \exists \)-theories of free projective planes
Siberian Mathematical Journal | 2020-06-24 | Paper |
Complexity of the isomorphism problem for computable free projective planes of finite rank
Siberian Mathematical Journal | 2018-07-19 | Paper |
The embedding problem for computable projective planes
Algebra and Logic | 2017-09-04 | Paper |
Freely generated projective planes with finite computable dimension
Algebra and Logic | 2017-09-04 | Paper |
\(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
Algebra and Logic | 2017-07-18 | Paper |
The theory of projective planes is complete with respect to degree spectra and effective dimensions
Algebra and Logic | 2016-03-02 | Paper |
On automaton presentations of projective planes
Siberian Mathematical Journal | 2014-11-04 | Paper |
| The complexity of the isomorphism problem for computable projective planes | 2014-02-26 | Paper |
Noncomputability of classes of Pappian and Desarguesian projective planes
Siberian Mathematical Journal | 2013-07-03 | Paper |
Computable dimensions of Pappusian and Desarguesian projective planes
Algebra and Logic | 2012-12-11 | Paper |
On \(\Sigma^0_1\)-classification of relations on computable structures
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika | 2012-05-21 | Paper |
Undecidability of the theory of projective planes
Algebra and Logic | 2010-09-25 | Paper |
The class of projective planes is noncomputable
Algebra and Logic | 2008-12-18 | Paper |
| Complexity of some natural problems on the class of computable \(I\)-algebras | 2007-07-26 | Paper |
| Complexity of some natural problems on the class of computable \(I\)-algebras | 2007-07-26 | Paper |
The Computable Dimension of I-Trees of Infinite Height
Algebra and Logic | 2006-07-18 | Paper |
| scientific article; zbMATH DE number 1873427 (Why is no real title available?) | 2003-02-24 | Paper |
| scientific article; zbMATH DE number 1746562 (Why is no real title available?) | 2002-05-28 | Paper |
| scientific article; zbMATH DE number 1534576 (Why is no real title available?) | 2000-11-21 | Paper |
Autostability of Boolean algebras with distinguished ideal
Siberian Mathematical Journal | 1999-05-11 | Paper |
