Domination, forcing, array nonrecursiveness and relative recursive enumerability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4172959 (Why is no real title available?)
- A 2-MINIMAL NON-GL2 DEGREE
- Array nonrecursiveness and relative recursive enumerability
- Bounding non-GL2 and R.E.A.
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
- Double jumps of minimal degrees
- Jump restricted interpolation in the recursively enumerable degrees
- Lowness for genericity
- On degrees of unsolvability
- Relative enumerability and 1-genericity
- The Theory of the Degrees below 0 ′
- Turing degrees of certain isomorphic images of computable relations
Cited in
(5)- Array nonrecursiveness and relative recursive enumerability
- scientific article; zbMATH DE number 841084 (Why is no real title available?)
- Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
- Defining totality in the enumeration degrees
- Three theorems on n-REA degrees: proof-readers and verifiers
This page was built for publication: Domination, forcing, array nonrecursiveness and relative recursive enumerability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388717)