A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
showed that the degree spectrum of any computable unary relation on (ω, <) either contains only the computable degree, or contains ∅ ′ -that is, if the relation is not intrinsically computable, then it contains ∅ ′ . However, their proof does not extend to n-ary relations, nor does it extend to relations on structures other than ω. We will show that their results can be extended in both of these directions, first by showing that the same result holds for n-ary relations on ω, and then showingdoi:10.3233/com-180086 fatcat:enddljyruzhqlbslvqovka2mjy