Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees - Couverture souple

Downey, Rodney G.; Ng, Keng Meng; Solomon, Reed

Couverture souple

ISBN 10 : 1470441624 ISBN 13 : 9781470441623

Editeur : American Mathematical Society, 2021

Synopsis

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 with computably enumerable Turing degrees and obtain three main results. 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.

A propos du livre

À propos de l?auteur

Rodney G. Downey, Victoria University of Wellington, New Zealand.

Keng Meng NgNanyang Technological University, Singapore.

Reed Solomon, University of Connecticut, Storrs, CT USA.

Détails de l'édition

• Éditeur: American Mathematical Society
• Date d'édition: 2021
• Langue: anglais
• ISBN 10: 1470441624
• ISBN 13: 9781470441623
• Reliure: Broché
• Nombre de pages: 90
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible