Publications in Math-Net.Ru
-
The recognition complexity of decidable theories
Eurasian Math. J., 13:1 (2022), 44–68
-
On computations over ordered rings
Sib. Èlektron. Mat. Izv., 19:2 (2022), 1054–1076
-
Recognition complexity of theories and their computational expressivity
Algebra Logika, 51:2 (2012), 216–238
-
On constructivizability of the tensor product of modules
Sibirsk. Mat. Zh., 43:2 (2002), 414–418
-
The Occurrence Problem for Subvarieties of the Variety $\mathbf N_2\mathbf A$ Revisited
Algebra Logika, 40:5 (2001), 580–592
-
Arithmetic hierarchy of torsion-free nilpotent groups
Algebra Logika, 35:3 (1996), 308–313
-
Algorithmic complexity of the occurrence problem in the commutants and in the terms of the lower central series
Sibirsk. Mat. Zh., 28:5 (1987), 102–110
© , 2026