Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees
Seiten
2021
American Mathematical Society (Verlag)
978-1-4704-4162-3 (ISBN)
American Mathematical Society (Verlag)
978-1-4704-4162-3 (ISBN)
Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. This book considers how minimal weak truth table degrees interact with computably enumerable Turing degrees and obtain three main results.
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.
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.
Rodney G. Downey, Victoria University of Wellington, New Zealand. Keng Meng NgNanyang Technological University, Singapore. Reed Solomon, University of Connecticut, Storrs, CT USA.
Erscheinungsdatum | 02.07.2020 |
---|---|
Reihe/Serie | Memoirs of the American Mathematical Society |
Verlagsort | Providence |
Sprache | englisch |
Maße | 178 x 254 mm |
Gewicht | 195 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
Mathematik / Informatik ► Mathematik ► Analysis | |
Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
ISBN-10 | 1-4704-4162-4 / 1470441624 |
ISBN-13 | 978-1-4704-4162-3 / 9781470441623 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
ein Übungsbuch für Fachhochschulen
Buch | Hardcover (2023)
Carl Hanser (Verlag)
16,99 €