Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees

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 we...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Downey, Rodney G., Ng, Keng Meng, Solomon, Reed
Médium: E-kniha Kniha
Jazyk:angličtina
Vydáno: Providence, Rhode Island American Mathematical Society 2020
Vydání:1
Edice:Memoirs of the American Mathematical Society
Témata:
Computable functions
Recursively enumerable sets
Unsolvability (Mathematical logic)
Computably enumerable set
Turing degree
weak truth table degree
minimal degree
ISBN:9781470441623, 1470441624
ISSN:0065-9266, 1947-6221
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Obsah:
  • Introduction -- Informal Construction -- Formal Construction -- Limiting Results
  • Cover -- Title page -- Chapter 1. Introduction -- Chapter 2. Informal Construction -- Chapter 3. Formal Construction -- Chapter 4. Limiting Results -- 4.1. Uniformity Issues -- 4.2. Almost C.E. Approximations -- 4.3. Proof of Second Main Theorem -- 4.4. Proof of the Third Main Theorem -- Bibliography -- Back Cover