RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Kogabaev Nurlan Talgatovich

Statistics Math-Net.Ru
Total publications: 16
Scientific articles: 16

Number of views:
This page:1048
Abstract pages:5883
Full texts:467
References:329
Associate professor
Candidate of physico-mathematical sciences
E-mail:

http://www.mathnet.ru/eng/person28418
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/639887

Publications in Math-Net.Ru
1. Complexity of the isomorphism problem for computable free projective planes of finite rank
N. T. Kogabaev
Sibirsk. Mat. Zh., 59:2 (2018),  378–395
2. The embedding problem for computable projective planes
N. T. Kogabaev
Algebra Logika, 56:1 (2017),  110–117
3. Freely generated projective planes with finite computable dimension
N. T. Kogabaev
Algebra Logika, 55:6 (2016),  704–737
4. $\Pi^1_1$-completeness of the computable categoricity problem for projective planes
N. T. Kogabaev
Algebra Logika, 55:4 (2016),  432–440
5. The theory of projective planes is complete with respect to degree spectra and effective dimensions
N. T. Kogabaev
Algebra Logika, 54:5 (2015),  599–627
6. On automatic presentations of projective planes
A. S. Denisenko, N. T. Kogabaev
Sibirsk. Mat. Zh., 55:1 (2014),  66–78
7. Noncomputability of classes of pappian and desarguesian projective planes
N. T. Kogabaev
Sibirsk. Mat. Zh., 54:2 (2013),  325–335
8. The complexity of isomorphism problem for computable projective planes
N. T. Kogabaev
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 13:1 (2013),  68–75
9. Computable dimensions of Pappusian and Desarguesian projective planes
N. T. Kogabaev
Algebra Logika, 51:1 (2012),  61–81
10. Undecidability of the theory of projective planes
N. T. Kogabaev
Algebra Logika, 49:1 (2010),  3–17
11. The class of projective planes is noncomputable
N. T. Kogabaev
Algebra Logika, 47:4 (2008),  428–455
12. On $\Sigma^0_1$-Classification of Relations on Computable Structures
S. S. Goncharov, N. T. Kogabaev
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8:4 (2008),  23–32
13. Complexity of some natural problems on the class of computable $I$-algebras
N. T. Kogabaev
Sibirsk. Mat. Zh., 47:2 (2006),  352–360
14. The Computable Dimension of $I$-Trees of Infinite Height
N. T. Kogabaev, O. V. Kudinov, R. Miller
Algebra Logika, 43:6 (2004),  702–729
15. Universal Numbering for Constructive $I$-Algebras
N. T. Kogabaev
Algebra Logika, 40:5 (2001),  561–579
16. Autostability of Boolean algebras with a distinguished ideal
N. T. Kogabaev
Sibirsk. Mat. Zh., 39:5 (1998),  1074–1084

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018