Degrees joining to 0′
From MaRDI portal
Publication:3665087
DOI10.2307/2273221zbMath0517.03014OpenAlexW2113021297MaRDI QIDQ3665087
David B. Posner, Robert W. Robinson
Publication date: 1981
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273221
Related Items
Bounding minimal degrees by computably enumerable degrees, Upper bounds for the arithmetical degrees, Complementing below recursively enumerable degrees, A join theorem for the computably enumerable degrees, Cupping with random sets, Minimal upper bounds for arithmetical degrees, Natural factors of the Muchnik lattice capturing IPC, The jump is definable in the structure of the degrees of unsolvability, How enumeration reductibility yields extended Harrington non-splitting, Cupping Classes of $\Sigma^0_2$ Enumeration Degrees, HIGHER RANDOMNESS AND GENERICITY, Complements for enumeration \(\Pi_1^0\)-degrees, Automorphism bases for degrees of unsolvability, The \(\omega\)-Turing degrees, Natural factors of the Medvedev lattice capturing IPC, On the strength of Ramsey's theorem for pairs, Two more characterizations of \(K\)-triviality, Finite cupping sets, The limitations of cupping in the local structure of the enumeration degrees, A single minimal complement for the c.e. degrees, 1-generic degrees and minimal degrees in higher recursion theory. II, Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets, Decidability and Invariant Classes for Degree Structures, The strong anticupping property for recursively enumerable degrees, Measure-theoretic applications of higher Demuth’s Theorem, DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES, Decomposing Borel functions using the Shore–Slaman join theorem, Mass problems associated with effectively closed sets, Extensions of embeddings below computably enumerable degrees, Uniform almost everywhere domination, Definability in the local structure of the ω-Turing degrees, A note on the join property, Learning via queries and oracles, Measures and their random reals, The upper semilattice of degrees ≤ 0′ is complemented, Minimal complementation below uniform upper bounds for the arithmetical degrees, Cone avoidance and randomness preservation, Forcing and reductibilities. II. Forcing in fragments of analysis, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
Cites Work
