|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
M. N. Gaskova, “On the 1-decidability of Boolean algebras with one distinguished ideal”, Sibirsk. Mat. Zh., 65:5 (2024), 852–862  ; Siberian Math. J., 65:5 (2024), 1053–1061 |
2
|
|
2022 |
| 2. |
M. N. Gaskova, “Boolean algebras autostable relative to $n$-decidable presentations”, Algebra Logika, 61:4 (2022), 443–460 ; Algebra and Logic, 61:4 (2022), 301–312 |
1
|
|
2020 |
| 3. |
M. N. Leont'eva, “Relatively intrinsically computable relations on boolean algebras with a distinguished set of atoms”, Sibirsk. Mat. Zh., 61:3 (2020), 622–633  ; Siberian Math. J., 61:3 (2020), 490–498   |
1
|
|
2014 |
| 4. |
M. N. Leontieva, “Strong constructivizability of Boolean algebras of elementary characteristic $(\infty,0,0)$”, Algebra Logika, 53:2 (2014), 185–205  ; Algebra and Logic, 53:2 (2014), 119–132 |
|
2013 |
| 5. |
M. N. Leont'eva, “A remark on a paper of I. V. Latkin”, Algebra Logika, 52:5 (2013), 642–645 ; Algebra and Logic, 52:5 (2013), 429–431 |
|
2012 |
| 6. |
M. N. Leontyeva, “The minimality of certain decidability conditions for Boolean algebras”, Sibirsk. Mat. Zh., 53:1 (2012), 132–147 ; Siberian Math. J., 53:1 (2012), 106–118 |
3
|
|
2011 |
| 7. |
M. N. Leontieva, “Boolean algebras of elementary characteristic (1,0,1) whose set of atoms and Ershov–Tarski ideal are computable”, Algebra Logika, 50:2 (2011), 133–151  ; Algebra and Logic, 50:2 (2011), 93–105 |
5
|
| 8. |
M. N. Leontyeva, “Sufficient Conditions of Decidability of Boolean Algebras”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:4 (2011), 63–68 ; J. Math. Sci., 195:6 (2013), 827–831 |
1
|
|
2010 |
| 9. |
M. N. Leontyeva, “Boolean Algebras of Elementary Characteristic $(1,0,1)$ with the Computable Set of Atoms and the Ideal of Atomic Elements”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 10:1 (2010), 65–69 ; J. Math. Sci., 186:3 (2012), 461–465 |
4
|
|
| Organisations |
|
|
