Extending Properly n-REA Sets

Peter A. Cholak, Peter M. Gerdes

In [5] Soare and Stob prove that if $A$ is an r.e. set which isn't computable then there is a set of the form $A\oplus W_e^A$ which isn't of r.e. Turing degree. If we define a pro…