A minimal degree not realizing least possible jump

DOI10.2307/2272899zbMath0318.02044OpenAlexW2046729032MaRDI QIDQ4079600

Leonard P. Jun. Sasso

Publication date: 1974

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (8)

Upper bounds for the arithmetical degrees ⋮ \(A\)-computable graphs ⋮ \(\Pi_1^0 \) classes, LR degrees and Turing degrees ⋮ Decidability and Invariant Classes for Degree Structures ⋮ Minimal Covers and Hyperdegrees ⋮ A 2-MINIMAL NON-GL₂ DEGREE ⋮ A reducibility related to being hyperimmune-free ⋮ Degrees which do not bound minimal degrees

Cites Work

• Minimal degrees and the jump operator
• Degrees of Unsolvability. (AM-55)

This page was built for publication: A minimal degree not realizing least possible jump