|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
N. T. Kogabaev, “О сложности проблемы $\forall$-представимости предложений”, Algebra Logika, 62:4 (2023), 552–557  |
| 2. |
N. T. Kogabaev, “Systems of diophantine equations over finite configurations”, Sibirsk. Mat. Zh., 64:2 (2023), 321–338  ; Siberian Math. J., 64:2 (2023), 325–337 |
|
2022 |
| 3. |
N. T. Kogabaev, “Complexity of the problem of being equivalent to Horn formulas. II”, Algebra Logika, 61:4 (2022), 469–482 |
1
|
|
2021 |
| 4. |
N. T. Kogabaev, “Complexity of the problem of being equivalent to Horn formulas”, Algebra Logika, 60:6 (2021), 575–586 |
2
|
| 5. |
N. T. Kogabaev, “On closure of configurations in freely generated projective planes”, Sib. Èlektron. Mat. Izv., 18:1 (2021), 358–368  |
|
2020 |
| 6. |
N. T. Kogabaev, “On the $\pmb{\forall}\pmb{\exists}$-theories of free projective planes”, Sibirsk. Mat. Zh., 61:1 (2020), 120–136 ; Siberian Math. J., 61:1 (2020), 95–108 |
1
|
|
2018 |
| 7. |
N. T. Kogabaev, “Complexity of the isomorphism problem for computable free projective planes of finite rank”, Sibirsk. Mat. Zh., 59:2 (2018), 378–395  ; Siberian Math. J., 59:2 (2018), 295–308  |
1
|
|
2017 |
| 8. |
N. T. Kogabaev, “The embedding problem for computable projective planes”, Algebra Logika, 56:1 (2017), 110–117  ; Algebra and Logic, 56:1 (2017), 75–79 |
1
|
|
2016 |
| 9. |
N. T. Kogabaev, “Freely generated projective planes with finite computable dimension”, Algebra Logika, 55:6 (2016), 704–737 ; Algebra and Logic, 55:6 (2017), 461–484 |
4
|
| 10. |
N. T. Kogabaev, “$\Pi^1_1$-completeness of the computable categoricity problem
for projective planes”, Algebra Logika, 55:4 (2016), 432–440 ; Algebra and Logic, 55:4 (2016), 283–288 |
|
2015 |
| 11. |
N. T. Kogabaev, “The theory of projective planes is complete with respect to degree spectra and effective dimensions”, Algebra Logika, 54:5 (2015), 599–627 ; Algebra and Logic, 54:5 (2015), 387–407 |
10
|
|
2014 |
| 12. |
A. S. Denisenko, N. T. Kogabaev, “On automatic presentations of projective planes”, Sibirsk. Mat. Zh., 55:1 (2014), 66–78 ; Siberian Math. J., 55:1 (2014), 53–62 |
|
2013 |
| 13. |
N. T. Kogabaev, “Noncomputability of classes of pappian and desarguesian projective planes”, Sibirsk. Mat. Zh., 54:2 (2013), 325–335 ; Siberian Math. J., 54:2 (2013), 247–255 |
3
|
| 14. |
N. T. Kogabaev, “The complexity of isomorphism problem for computable projective planes”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 13:1 (2013), 68–75 ; J. Math. Sci., 203:4 (2014), 509–515 |
3
|
|
2012 |
| 15. |
N. T. Kogabaev, “Computable dimensions of Pappusian and Desarguesian projective planes”, Algebra Logika, 51:1 (2012), 61–81 ; Algebra and Logic, 51:1 (2012), 41–55 |
1
|
|
2010 |
| 16. |
N. T. Kogabaev, “Undecidability of the theory of projective planes”, Algebra Logika, 49:1 (2010), 3–17 ; Algebra and Logic, 49:1 (2010), 1–11 |
2
|
|
2008 |
| 17. |
N. T. Kogabaev, “The class of projective planes is noncomputable”, Algebra Logika, 47:4 (2008), 428–455 ; Algebra and Logic, 47:4 (2008), 242–257 |
5
|
| 18. |
S. S. Goncharov, N. T. Kogabaev, “On $\Sigma^0_1$-Classification of Relations on Computable Structures”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8:4 (2008), 23–32 |
2
|
|
2006 |
| 19. |
N. T. Kogabaev, “Complexity of some natural problems on the class of computable $I$-algebras”, Sibirsk. Mat. Zh., 47:2 (2006), 352–360 ; Siberian Math. J., 47:2 (2006), 291–297 |
1
|
|
2004 |
| 20. |
N. T. Kogabaev, O. V. Kudinov, R. Miller, “The Computable Dimension of $I$-Trees of Infinite Height”, Algebra Logika, 43:6 (2004), 702–729 ; Algebra and Logic, 43:6 (2004), 393–407 |
4
|
|
2001 |
| 21. |
N. T. Kogabaev, “Universal Numbering for Constructive $I$-Algebras”, Algebra Logika, 40:5 (2001), 561–579 ; Algebra and Logic, 40:5 (2001), 315–326 |
5
|
|
1998 |
| 22. |
N. T. Kogabaev, “Autostability of Boolean algebras with a distinguished ideal”, Sibirsk. Mat. Zh., 39:5 (1998), 1074–1084 ; Siberian Math. J., 39:5 (1998), 927–935 |
8
|
|
| Organisations |
|
| |
|
|
Contact us: