Complementing below recursively enumerable degrees

DOI10.1016/0168-0072(87)90039-XzbMath0629.03016MaRDI QIDQ1093627

Richard L. Epstein, S. Barry Cooper

Publication date: 1987

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

minimal degreer.e. degreescomplementation theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Bounding minimal degrees by computably enumerable degrees ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ A splitting theorem for $n-REA$ degrees ⋮ Computably enumerable Turing degrees and the meet property ⋮ The strong anticupping property for recursively enumerable degrees ⋮ On a problem of Cooper and Epstein

Cites Work

• Degrees of unsolvability: structure and theory
• A minimal degree less than 0’
• Degrees joining to 0′
• The upper semilattice of degrees ≤ 0′ is complemented
• Initial segments of degrees below 0′
• Minimal degrees of unsolvability and the full approximation construction
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• A theorem on minimal degrees
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1

This page was built for publication: Complementing below recursively enumerable degrees