On the jumps of the degrees below a recursively enumerable degree

DOI10.1215/00294527-2017-0014zbMATH Open1455.03052OpenAlexW2738315101MaRDI QIDQ1704085FDOQ1704085

Authors: 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

Recommendations

• scientific article; zbMATH DE number 66485
• T-Degrees, Jump Classes, and Strong Reducibilities
• Definability in the Recursively Enumerable Degrees
• The jump is definable in the structure of the degrees of unsolvability
• Nonisolated degrees and the jump operator

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

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

Cited In (3)

• Title not available (Why is that?)
• Badness and jump inversion in the enumeration degrees
• A jump class of noncappable degrees

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

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