A New Reducibility between Turing‐ and wtt‐Reducibility
Sui Yuefei · Mathematical logic quarterly · 1994
Abstract A new reducibility between Turing and weak truth‐table reducibility is defined, which gives an affirmative answer to the open question about the existence of such an intermediate reducibility proposed formally by M. Stob. Mathematics Subject Classification: 03D25.