6
votes
Accepted
2-REA PA degrees
Theorem 5.1 in Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion states that Arslanov's completeness criterion holds for $n$-REA sets. The paper is ...
2
votes
Accepted
Double Hop Inversion Theorem
Ohh, I think I was being dumb. There is a 2-REA operator $J$ such that $J(X) <_T X'$ isn't of degree r.e. in $X$. Since $0''$ is of r.e. degree in every $X < 0''$ with $X' \geq_T 0''$.
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
lo.logic × 7computability-theory × 7
recursive-enumerability-above × 7
recursively-enumerable × 5
arithmetic-degree × 1
turing-degrees × 1