Domination, forcing, array nonrecursiveness and relative recursive enumerability

DOI10.2178/jsl/1327068690zbMath1269.03045OpenAlexW2099157343MaRDI 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

zbMATH Keywords

forcingdominationarray nonrecursive degree

Mathematics Subject Classification ID

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

Related Items (4)

Array nonrecursiveness and relative recursive enumerability ⋮ Defining totality in the enumeration degrees ⋮ Three Theorems on n-REA Degrees: Proof-Readers and Verifiers ⋮ Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$

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-GL₂ DEGREE
• Relative enumerability and 1-genericity
• Bounding non-GL₂ 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

This page was built for publication: Domination, forcing, array nonrecursiveness and relative recursive enumerability