Initial segments of the degrees of unsolvability Part II: minimal degrees
From MaRDI portal
Publication:5623675
DOI10.2307/2270517zbMath0219.02031OpenAlexW2079464688MaRDI QIDQ5623675
Publication date: 1970
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270517
Related Items
Bounding minimal degrees by computably enumerable degrees ⋮ Complementing below recursively enumerable degrees ⋮ \(\Pi_1^0\) classes and minimal degrees ⋮ The arithmetic and Turing degrees are not elementarily equivalent ⋮ The degrees below a 1-generic degree < 0′ ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ \(A\)-computable graphs ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ RELATIVE DEFINABILITY OF n-GENERICS ⋮ Generic degrees are complemented ⋮ Banach–Mazur games, comeager sets and degrees of unsolvability ⋮ Decidability and Invariant Classes for Degree Structures ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ Diagonalization in degree constructions ⋮ On a problem of Cooper and Epstein ⋮ Double jumps of minimal degrees ⋮ 1-generic splittings of computably enumerable degrees
Cites Work
- On degrees of recursive unsolvability
- Three theorems on the degrees of recursively enumerable sets
- The recursively enumerable degrees are dense
- On the degrees less than 0'
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- A minimal degree less than 0’
- Degrees of Unsolvability. (AM-55)
- Distributive Initial Segments of the Degrees of Unsolvability
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Recursively enumerable sets of positive integers and their decision problems
