Minimal Weak Truth Table Degrees And Computably Enumerable Turing Degrees

Download or read book Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees written by Rodney G. Downey and published by American Mathematical Soc.. This book was released on 2020-09-28 with total page 90 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.