Marat M. Arslanov
According to our database^{1},
Marat M. Arslanov
authored at least 16 papers
between 1987 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at zbmath.org
On csauthors.net:
Bibliography
2018
Splitting and nonsplitting in the difference hierarchy.
Mathematical Structures in Computer Science, 2018
2017
Deep learning features exception for crossseason visual place recognition.
Pattern Recognition Letters, 2017
A Survey of Results on the dc.e. and nc.e. Degrees.
Proceedings of the Computability and Complexity, 2017
2013
Definable relations in Turing degree structures.
J. Log. Comput., 2013
2012
Modeltheoretic properties of the nc.e. degrees.
J. Log. Comput., 2012
2011
Splitting and nonsplitting in the Σ_{2}^{0} enumeration degrees.
Theor. Comput. Sci., 2011
2010
On Downey's conjecture.
J. Symb. Log., 2010
2008
Structural properties of Qdegrees of nc. e. sets.
Ann. Pure Appl. Logic, 2008
Total Degrees and Nonsplitting Properties of Enumeration Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2008
2005
The minimal edegree problem in fragments of Peano arithmetic.
Ann. Pure Appl. Logic, 2005
2004
There is no low maximal d. c. e. degree  Corrigendum.
Math. Log. Q., 2004
2001
Density results in the Delta20 edegrees.
Arch. Math. Log., 2001
2000
There is No Low Maximal D.C.E. Degree.
Math. Log. Q., 2000
1998
Relative Enumerability in the Difference Hierarchy.
J. Symb. Log., 1998
1996
Interpolating dr.e. and REA Degrees between r.e. Degrees.
Ann. Pure Appl. Logic, 1996
1987
The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets.
Proceedings of the Fundamentals of Computation Theory, 1987