The strong anticupping property for recursively enumerable degrees
From MaRDI portal
Publication:4713085
DOI10.2307/2274867zbMath0749.03033OpenAlexW2144087671MaRDI QIDQ4713085
Publication date: 25 June 1992
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274867
Related Items (12)
Minimal upper bounds for arithmetical degrees ⋮ Intervals containing exactly one c.e. degree ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ Strong noncuppability in low computably enumerable degrees ⋮ Complementation in the Turing degrees ⋮ Weak density and cupping in the d-r.e. degrees ⋮ Computably enumerable Turing degrees and the meet property ⋮ On a problem of Cooper and Epstein ⋮ Extensions of embeddings below computably enumerable degrees ⋮ A note on the join property ⋮ Dynamic notions of genericity and array noncomputability ⋮ Minimal complementation below uniform upper bounds for the arithmetical degrees
Cites Work
This page was built for publication: The strong anticupping property for recursively enumerable degrees
