Defining Jump Classes in the Degrees Below 0'

DOI10.2307/2047504MaRDI QIDQ3812224zbMATH OpenOpenAlexFDO

Authors Richard A. Shore

Publication date 1988

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2047504

zbMATH Keywords

definability of classes of degreesjumprecursively enumerable degreeTuring degrees

Mathematics Subject Classification ID

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

Recommendations

• Definability in the Recursively Enumerable Degrees
• The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
• Interpretability and Definability in the Recursively Enumerable Degrees
• Nonbounding and Slaman triples
• The jump is definable in the structure of the degrees of unsolvability

Cited in

(7)

• Token jumping in minor-closed classes
• Nonbounding and Slaman triples
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• Definability in the Recursively Enumerable Degrees
• Decidability and Invariant Classes for Degree Structures
• The jump is definable in the structure of the degrees of unsolvability
• Working below a \(low_ 2\) recursively enumerable degree

This page was built for publication: Defining Jump Classes in the Degrees Below 0'

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