Intrinsic Reducibilities

Abstract

Let α < ω CK 1 . We show that for many reducibilities, the requirement that a relation be intrinsically reducible to the α-th jump of a countable model A has a syntactic equivalent. Furthermore, we show that many reducibilities coincide in such a situation.Mathematics Subject Classification: 03D30, 03D25, 03C57.