A Refinement of Lown and Highn for the R.E. Degrees
From MaRDI portal
Publication:3026991
DOI10.1002/malq.19860320103zbMath0625.03022MaRDI QIDQ3026991
Publication date: 1986
Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19860320103
Turing jump; analogues of the Sacks Jump Theorem for tt- degrees; high n r.e. degree; low n r.e. degree; truth table equivalence
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Characterizing the strongly jump-traceable sets via randomness, On arithmetical level of the class of superhigh sets, A superhigh diamond in the c.e. tt-degrees, Lattice nonembeddings and initial segments of the recursively enumerable degrees, Dynamic notions of genericity and array noncomputability, Bounded low and high sets, Strong jump-traceability. I: The computably enumerable case, Lowness properties and approximations of the jump, Lowness, Randomness, and Computable Analysis, MASS PROBLEMS AND HYPERARITHMETICITY, Promptness does not imply superlow cuppability