Marat M. Arslanov
(Kazan State University)
Definable Relations in the Turing Degree Structures

I will consider classes of n-c.e. sets and degrees which are definable in the language of the n-c.e. sets { ⊆, ∪, ∩, 0, ω } and in the language of the Turing degrees { ≤T }.