|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
1. |
P. M. Semukhin, D. Turetsky, E. B. Fokina, “Degree spectra of structures relative to equivalences”, Algebra Logika, 58:2 (2019), 229–251 ; Algebra and Logic, 58:2 (2019), 158–172 |
3
|
|
2018 |
2. |
N. A. Bazhenov, E. B. Fokina, D. Rossegger, L. San Mauro, “Computable bi-embeddable categoricity”, Algebra Logika, 57:5 (2018), 601–608 ; Algebra and Logic, 57:5 (2018), 392–396 |
4
|
|
2015 |
3. |
E. B. Fokina, S. S. Goncharov, V. Harizanov, O. V. Kudinov, D. Turetsky, “Index sets for $n$-decidable structures categorical relative to $m$-decidable presentations”, Algebra Logika, 54:4 (2015), 520–528 ; Algebra and Logic, 54:4 (2015), 336–341 |
11
|
|
2011 |
4. |
J. Carson, E. Fokina, V. S. Harizanov, J. F. Knight, S. Quinn, C. Safranski, J. Wallbaum, “The computable embedding problem”, Algebra Logika, 50:6 (2011), 707–732 ; Algebra and Logic, 50:6 (2012), 478–493 |
4
|
|
2008 |
5. |
E. B. Fokina, “Algorithmic Properties of Structures for the Language with Two Unary Functional Symbols”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8:1 (2008), 90–101 |
|
2007 |
6. |
E. B. Fokina, “Index sets of decidable models”, Sibirsk. Mat. Zh., 48:5 (2007), 1167–1179 ; Siberian Math. J., 48:5 (2007), 939–948 |
22
|
|
2006 |
7. |
E. B. Fokina, “On spectra of computable models”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 6:4 (2006), 93–97 |
1
|
|
2005 |
8. |
E. Fokina, “Complexity of categorical theories with computable models”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 5:2 (2005), 77–85 |
1
|
|
Organisations |
|
|
|
|