Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees

Rodney G. Downey · Keng Meng Ng · Reed Solomon

2020 թ. սեպ · Memoirs of the American Mathematical Society Գիրք 265 · American Mathematical Soc.

Այս էլ․ գրքի մասին

First, there are sets with minimal weak truth table degree which bound noncomputable computably enumerable sets under Turing reducibility. Second, no set with computable enumerable Turing degree can have minimal weak truth table degree. Third, no $Delta^0_2$ set which Turing bounds a promptly simple set can have minimal weak truth table degree.