Skip to main content alibris logo

Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees

by , ,

Write The First Customer Review
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees - Downey, Rodney G., and Ng, Keng Meng, and Solomon, Reed
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. For strong notions of reducibility, such as $m$-deducibility or truth table reducibility, it is possible for computably enumerable degrees to be minimal. For weaker notions of reducibility, such as weak truth table reducibility or Turing reducibility, it is not possible to combine these properties in a single degree. This book considers how minimal weak truth table degrees interact ...

loading
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees 2021, American Mathematical Society, Providence

ISBN-13: 9781470441623

Paperback