Publication:4449350
From MaRDI portal
zbMath1032.03037MaRDI QIDQ4449350
S. Barry Cooper, Iskander Sh. Kalimullin, Marat M. Arslanov
Publication date: 9 February 2004
Full work available at URL: https://eudml.org/doc/188035
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS, Definability via Kalimullin pairs in the structure of the enumeration degrees, IN MEMORIAM: BARRY COOPER 1943–2015, Cupping and definability in the local structure of the enumeration degrees, On Kalimullin pairs, Defining totality in the enumeration degrees, Badness and jump inversion in the enumeration degrees, Strong enumeration reducibilities, Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective, Structural properties of \(Q\)-degrees of n-c.e. sets, Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees, Enumeration Reducibility and Computable Structure Theory, Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees