|
|||||
|
|
Intrinsic Reducibilities |
|
| Authors: | Timothy H. McNicholl |
| Abstract: | 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. |
| Keywords: | Intrinsically reducible n‐query reducibility Truth‐table reducibility n‐recursive enumerability Bounded query classes |