Domination, forcing, array nonrecursiveness and relative recursive enumerability
From MaRDI portal
Publication:5388717
DOI10.2178/jsl/1327068690zbMath1269.03045MaRDI QIDQ5388717
Richard A. Shore, Mingzhong Cai
Publication date: 19 April 2012
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1327068690
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Array nonrecursiveness and relative recursive enumerability, Defining totality in the enumeration degrees, Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$, Three Theorems on n-REA Degrees: Proof-Readers and Verifiers
Cites Work
- Unnamed Item
- Lowness for genericity
- Turing degrees of certain isomorphic images of computable relations
- Jump restricted interpolation in the recursively enumerable degrees
- On degrees of unsolvability
- A 2-MINIMAL NON-GL2 DEGREE
- Relative enumerability and 1-genericity
- Bounding non-GL2 and R.E.A.
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
- The Theory of the Degrees below 0 ′
- Double jumps of minimal degrees
- Array nonrecursiveness and relative recursive enumerability