×

Kogabaev, Nurlan Talgatovich

Author ID: kogabaev.nurlan-talgatovich Recent zbMATH articles by "Kogabaev, Nurlan Talgatovich"
Published as: Kogabaev, N. T.; Kogabaev, Nurlan Talgatovich
Documents Indexed: 23 Publications since 1998
Co-Authors: 4 Co-Authors with 3 Joint Publications
218 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

15 Publications have been cited 42 times in 31 Documents Cited by Year
The theory of projective planes is complete with respect to degree spectra and effective dimensions. Zbl 1375.03038
Kogabaev, N. T.
9
2015
The class of projective planes is noncomputable. Zbl 1164.03330
Kogabaev, N. T.
5
2008
The computable dimension of \(I\)-trees of infinite height. Zbl 1096.03051
Kogabaev, N. T.; Kudinov, O. V.; Miller, Russell
4
2004
Autostability of Boolean algebras with distinguished ideal. Zbl 0913.06011
Kogabaev, N. T.
4
1998
Universal numbering for constructive \(I\)-algebras. Zbl 0989.03041
Kogabaev, N. T.
4
2001
Freely generated projective planes with finite computable dimension. Zbl 1420.03073
Kogabaev, N. T.
4
2017
Noncomputability of classes of Pappian and Desarguesian projective planes. Zbl 1273.03122
Kogabaev, N. T.
3
2013
On \(\Sigma^0_1\)-classification of relations on computable structures. Zbl 1249.03058
Goncharov, S. S.; Kogabaev, N. T.
2
2008
Complexity of some natural problems on the class of computable \(I\)-algebras. Zbl 1115.03050
Kogabaev, N. T.
1
2006
Complexity of the problem of being equivalent to Horn formulas. Zbl 1515.03183
Kogabaev, N. T.
1
2022
Undecidability of the theory of projective planes. Zbl 1195.03043
Kogabaev, N. T.
1
2010
Complexity of the isomorphism problem for computable free projective planes of finite rank. Zbl 1522.03127
Kogabaev, N. T.
1
2018
The embedding problem for computable projective planes. Zbl 1420.03074
Kogabaev, N. T.
1
2017
The complexity of the isomorphism problem for computable projective planes. Zbl 1289.03028
Kogabaev, N. T.
1
2013
On the \(\forall \exists \)-theories of free projective planes. Zbl 1484.03071
Kogabaev, N. T.
1
2020
Complexity of the problem of being equivalent to Horn formulas. Zbl 1515.03183
Kogabaev, N. T.
1
2022
On the \(\forall \exists \)-theories of free projective planes. Zbl 1484.03071
Kogabaev, N. T.
1
2020
Complexity of the isomorphism problem for computable free projective planes of finite rank. Zbl 1522.03127
Kogabaev, N. T.
1
2018
Freely generated projective planes with finite computable dimension. Zbl 1420.03073
Kogabaev, N. T.
4
2017
The embedding problem for computable projective planes. Zbl 1420.03074
Kogabaev, N. T.
1
2017
The theory of projective planes is complete with respect to degree spectra and effective dimensions. Zbl 1375.03038
Kogabaev, N. T.
9
2015
Noncomputability of classes of Pappian and Desarguesian projective planes. Zbl 1273.03122
Kogabaev, N. T.
3
2013
The complexity of the isomorphism problem for computable projective planes. Zbl 1289.03028
Kogabaev, N. T.
1
2013
Undecidability of the theory of projective planes. Zbl 1195.03043
Kogabaev, N. T.
1
2010
The class of projective planes is noncomputable. Zbl 1164.03330
Kogabaev, N. T.
5
2008
On \(\Sigma^0_1\)-classification of relations on computable structures. Zbl 1249.03058
Goncharov, S. S.; Kogabaev, N. T.
2
2008
Complexity of some natural problems on the class of computable \(I\)-algebras. Zbl 1115.03050
Kogabaev, N. T.
1
2006
The computable dimension of \(I\)-trees of infinite height. Zbl 1096.03051
Kogabaev, N. T.; Kudinov, O. V.; Miller, Russell
4
2004
Universal numbering for constructive \(I\)-algebras. Zbl 0989.03041
Kogabaev, N. T.
4
2001
Autostability of Boolean algebras with distinguished ideal. Zbl 0913.06011
Kogabaev, N. T.
4
1998

Citations by Year