|
|
Publications in Math-Net.Ru
-
The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable
Chebyshevskii Sb., 24:1 (2023), 40–49
-
An extension of a theorem of Neumann
Mat. Tr., 26:1 (2023), 41–46
-
On equations in free monoids and semigroups with restrictions on solutions
Prikl. Diskr. Mat., 2023, no. 59, 5–19
-
Violation of finite approximability for single-coefficient commutant equations
Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2022, no. 2, 5–13
-
On “simple” algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup
Chebyshevskii Sb., 21:4 (2020), 56–71
-
On elementary theories of algebraically closed groups
Chebyshevskii Sb., 21:1 (2020), 186–199
-
On equations and inequalities in words and word lengths
Chebyshevskii Sb., 17:2 (2016), 137–145
-
On amenable subgroups of $F$-groups
Chebyshevskii Sb., 17:2 (2016), 128–136
-
About the coNP-complete “Injective knapsack” problem
Prikl. Diskr. Mat., 2016, no. 3(33), 85–92
-
On the Tits’ alternative for subgroups of $F$-groups
Chebyshevskii Sb., 15:1 (2014), 110–120
-
On automorphic reducibility for sets elements of free groups
Chebyshevskii Sb., 14:3 (2013), 52–55
-
An algebraically closed groups
Chebyshevskii Sb., 14:3 (2013), 49–51
© , 2024