Turing degree
A Turing degree is defined to be a PA degree if there is a set of natural numbers in the degree that computes a completion of Peano Arithmetic. (This is equivalent to the proposition that every set in the degree computes a completion of PA.) Because there are no computable completions of PA, the degree 0 consisting of the computable sets of natural numbers is not a PA degree.