Degrees joining to 0′

DOI10.2307/2273221zbMATH Open0517.03014OpenAlexW2113021297MaRDI QIDQ3665087FDOQ3665087

Authors: David B. Posner, R. 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

zbMATH Keywords

joindegrees of unsolvabilityjump operation

Mathematics Subject Classification ID

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

Cites Work

• The Degrees of Hyperimmune Sets
• Minimal degrees and the jump operator
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Title not available (Why is that?)
• A theorem on minimal degrees

Cited In (39)

• Forcing and reductibilities. II. Forcing in fragments of analysis
• Complements for enumeration \(\Pi_1^0\)-degrees
• Mass problems associated with effectively closed sets
• On the strength of Ramsey's theorem for pairs
• Complementing below recursively enumerable degrees
• A join theorem for the computably enumerable degrees
• The strong anticupping property for recursively enumerable degrees
• Measure-theoretic applications of higher Demuth's theorem
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• How enumeration reductibility yields extended Harrington non-splitting
• The \(\omega\)-Turing degrees
• Two more characterizations of \(K\)-triviality
• 1-generic degrees and minimal degrees in higher recursion theory. II
• A note on the join property
• Extensions of embeddings below computably enumerable degrees
• Minimal upper bounds for arithmetical degrees
• Finite cupping sets
• Higher randomness and genericity
• The limitations of cupping in the local structure of the enumeration degrees
• Decomposing Borel functions using the Shore-Slaman join theorem
• Bounding minimal degrees by computably enumerable degrees
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Definability in the local structure of the \(\omega\)-Turing degrees
• Natural factors of the Medvedev lattice capturing IPC
• Learning via queries and oracles
• The upper semilattice of degrees ≤ 0′ is complemented
• Decidability and Invariant Classes for Degree Structures
• Upper bounds for the arithmetical degrees
• Cone avoidance and randomness preservation
• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
• A single minimal complement for the c.e. degrees
• Automorphism bases for degrees of unsolvability
• Measures and their random reals
• Uniform almost everywhere domination
• Cupping with random sets
• Minimal complementation below uniform upper bounds for the arithmetical degrees
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Natural factors of the Muchnik lattice capturing IPC
• The jump is definable in the structure of the degrees of unsolvability

This page was built for publication: Degrees joining to 0′

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3665087)