Marat M. Arslanov

According to our database1, Marat M. Arslanov authored at least 16 papers between 1987 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Splitting and non-splitting in the difference hierarchy.
Mathematical Structures in Computer Science, 2018

2017
Deep learning features exception for cross-season visual place recognition.
Pattern Recognition Letters, 2017

A Survey of Results on the d-c.e. and n-c.e. Degrees.
Proceedings of the Computability and Complexity, 2017

2013
Definable relations in Turing degree structures.
J. Log. Comput., 2013

2012
Model-theoretic properties of the n-c.e. degrees.
J. Log. Comput., 2012

2011
Splitting and nonsplitting in the Σ20 enumeration degrees.
Theor. Comput. Sci., 2011

2010
On Downey's conjecture.
J. Symb. Log., 2010

2008
Structural properties of Q-degrees of n-c. 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 e-degree 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 e-degrees.
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 d-r.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


  Loading...