Degrees of unsolvability complementary between recursively enumerable degrees, Part 1

DOI10.1016/0003-4843(72)90011-3zbMath0248.02045OpenAlexW2166032841MaRDI QIDQ5661863

S. Barry Cooper

Publication date: 1972

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(72)90011-3

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Complementing below recursively enumerable degrees, Embedding the diamond in the Σ₂ enumeration degrees, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, A superhigh diamond in the c.e. tt-degrees, Infima in the d.r.e. degrees, Weakly computable real numbers, Joining up to the generalized high degrees, Recursively enumerable sets and degrees, Minimal Covers and Hyperdegrees, Double jumps of minimal degrees