|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
I. V. Latkin, “The recognition complexity of decidable theories”, Eurasian Math. J., 13:1 (2022), 44–68    |
| 2. |
I. V. Latkin, A. V. Seliverstov, “On computations over ordered rings”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 1054–1076 |
|
2012 |
| 3. |
I. V. Latkin, “Recognition complexity of theories and their computational expressivity”, Algebra Logika, 51:2 (2012), 216–238  ; Algebra and Logic, 51:2 (2012), 144–159  |
1
|
|
2002 |
| 4. |
I. V. Latkin, “On constructivizability of the tensor product of modules”, Sibirsk. Mat. Zh., 43:2 (2002), 414–418 ; Siberian Math. J., 43:2 (2002), 330–333 |
2
|
|
2001 |
| 5. |
I. V. Latkin, “The Occurrence Problem for Subvarieties of the Variety $\mathbf N_2\mathbf A$ Revisited”, Algebra Logika, 40:5 (2001), 580–592 ; Algebra and Logic, 40:5 (2001), 327–333 |
1
|
|
1996 |
| 6. |
I. V. Latkin, “Arithmetic hierarchy of torsion-free nilpotent groups”, Algebra Logika, 35:3 (1996), 308–313 |
6
|
|
1987 |
| 7. |
I. V. Latkin, “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 ; Siberian Math. J., 28:5 (1987), 772–779 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: