A non-inversion theorem for the jump operator

DOI10.1016/0168-0072(88)90034-6zbMath0658.03024OpenAlexW2016891068MaRDI QIDQ1111549

Richard A. Shore

Publication date: 1988

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(88)90034-6

zbMATH Keywords

partial ordersdegrees of unsolvabilitypriority argumentFriedberg inversion theoremREASacks inversion theorem

Mathematics Subject Classification ID

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

Related Items (15)

Decomposition and infima in the computably enumerable degrees ⋮ 2000 Annual Meeting of the Association for Symbolic Logic ⋮ Completely mitotic r. e. degrees ⋮ \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees ⋮ There is no fat orbit ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility ⋮ On the jumps of the degrees below a recursively enumerable degree ⋮ Incomparable prime ideals of recursively enumerable degrees ⋮ Completely mitotic c.e. degrees and non-jump inversion ⋮ On low for speed oracles ⋮ A set with barely degree ⋮ Some orbits for \({\mathcal E}\) ⋮ Completing pseudojump operators ⋮ Splitting theorems in recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Initial segments of the degrees of unsolvability
• Jump restricted interpolation in the recursively enumerable degrees
• On degrees of unsolvability
• A criterion for completeness of degrees of unsolvability
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• A jump class of noncappable degrees
• Decidability and Invariant Classes for Degree Structures
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Bounding minimal pairs
• Jumping through the transfinite: the master code hierarchy of Turing degrees
• Minimal degrees and the jump operator
• A recursively enumerable degree which will not split over all lesser ones
• Transfinite extensions of Friedberg's completeness criterion
• Double jumps of minimal degrees
• On the Degrees of Index Sets
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Recursive Enumerability and the Jump Operator

This page was built for publication: A non-inversion theorem for the jump operator