7:50 AM
@MartinSleziak I unabbreviated to recursive-enumerability-above (by replacing the tag and copying the tag excerpt)

2 hours later…
9:21 AM
- see above. Here is link to the tag-excerpt.
1

So a common method used to construct non-zero $\omega$-REA arithmetic degrees with various properties is to build an $\omega$-REA operator $J$ satisfying the constraints that (for all $X$) $$\tag{1} J(X') \equiv_T J(X) \oplus X'$$ $$\tag{2} J(X) >_T X$$ Inductively, 1 implies that \$J(X^n) \equiv_...