Definable relations in Turing degree structures

DOI10.1093/logcom/ext046zbMath1327.03032OpenAlexW2146627067WikidataQ128145806 ScholiaQ128145806MaRDI QIDQ5406111

Marat M. Arslanov

Publication date: 1 April 2014

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/ext046

zbMATH Keywords

Turing degreesc.e. setsErshov difference hierarchyhigh degreesdefinable classes\(n\)-c.e. setsmajor sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items

On the problem of definability of the computably enumerable degrees in the difference hierarchy, Turing computability: structural theory