( en | de | ru )

 

Disambiguation of "Arslanov, Marat M."

Author of the publication

copydeleteadd this publication to your clipboard
A Survey of Results on the d-c.e. and n-c.e. Degrees.

, and . Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 469-478. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Raden Marat

Panagis Stylianos Maratos

Yvonne Kalliope Maratos

Günther Marat

Nicos Marathovouniotis

 

Other publications of authors with the same name

Definable relations in Turing degree structures.. J. Log. Comput., 23 (6): 1145-1154 (2013)On Downey's conjecture., , and . J. Symb. Log., 75 (2): 401-441 (2010)The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets.. FCT, volume 278 of Lecture Notes in Computer Science, page 34-37. Springer, (1987)Total Degrees and Nonsplitting Properties of Enumeration Degrees., , , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 568-578. Springer, (2008)Splitting and non-splitting in the difference hierarchy.. Math. Struct. Comput. Sci., 28 (3): 384-391 (2018)There is No Low Maximal D.C.E. Degree., , and . Math. Log. Q., 46 (3): 409-416 (2000)Density results in the Delta20 e-degrees., , and . Arch. Math. Log., 40 (8): 597-614 (2001)Model-theoretic properties of the n-c.e. degrees.. J. Log. Comput., 22 (4): 669-677 (2012)A Survey of Results on the d-c.e. and n-c.e. Degrees., and . Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 469-478. Springer, (2017)The minimal e-degree problem in fragments of Peano arithmetic., , , and . Ann. Pure Appl. Log., 131 (1-3): 159-175 (2005)