Intrinsic Reducibilities
Timothy H. McNicholl · Mathematical logic quarterly · 2000
Let . We show that for many reducibilities, the requirement that a relation be intrinsically reducible to the α-th jump of a countable mode A has a syntactic equivalent. Furthermore, we show that many reducibilities coincide in such a situation.