Another recursion theory / decidability question

Imagine one has some single sentence S in predicate logic. The set of
consequences of S (i.e., the set of theorems one can prove using S as a
premise) is, of course, recursively enumerable. Can this set of
consequences of S have a degree -other- than 0 or 0'?

Kevin


.