Minimal complements for degrees below 0′

DOI10.2178/jsl/1102022208zbMath1086.03031OpenAlexW2102988122MaRDI QIDQ5311764

No author found.

Publication date: 29 August 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1102022208

zbMATH Keywords

Turing degreeminimal complement

Mathematics Subject Classification ID

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

Related Items (5)

Complementing cappable degrees in the difference hierarchy. ⋮ Finite cupping sets ⋮ Joining up to the generalized high degrees ⋮ A single minimal complement for the c.e. degrees ⋮ Computably enumerable Turing degrees and the meet property

Cites Work

• Classical recursion theory. Vol. II
• Complementation in the Turing degrees
• The upper semilattice of degrees ≤ 0′ is complemented
• Minimal degrees and the jump operator
• Degrees of Unsolvability. (AM-55)

This page was built for publication: Minimal complements for degrees below 0′