On the jumps of the degrees below a recursively enumerable degree

DOI10.1215/00294527-2017-0014zbMath1455.03052OpenAlexW2738315101MaRDI QIDQ1704085

David R. Belanger, Richard A. Shore

Publication date: 8 March 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1500537625

zbMATH Keywords

rigidity problemTuring jumpr.e. degrees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• A non-inversion theorem for the jump operator
• Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
• Jump restricted interpolation in the recursively enumerable degrees
• Some More Minimal Pairs of α‐Recursively Enumerable Degrees
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Pseudo Jump Operators. I: The R. E. Case
• Interpretability and Definability in the Recursively Enumerable Degrees
• Recursive Enumerability and the Jump Operator

This page was built for publication: On the jumps of the degrees below a recursively enumerable degree