Jump restricted interpolation in the recursively enumerable degrees

DOI10.2307/1970889zbMATH Open0259.02034OpenAlexW2320833443MaRDI QIDQ2560239FDOQ2560239

Authors: R. W. Robinson 

Publication date: 1971

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cited In (14)

• A non-inversion theorem for the jump operator
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• Limits on jump inversion for strong reducibilities
• On the structures inside truth-table degrees
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Working below a \(low_ 2\) recursively enumerable degree
• On the jumps of the degrees below a recursively enumerable degree
• Elementary differences among jump classes
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• A hierarchy for the plus cupping Turing degrees
• Recursively enumerable sets and degrees
• Bounding non-GL₂ and R.E.A.
• Decidability and Invariant Classes for Degree Structures
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees

This page was built for publication: Jump restricted interpolation in the recursively enumerable degrees

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