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

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Downey, Rodney G., Ng, Keng Meng, Solomon, Reed
Format:	E-Book Buch
Sprache:	Englisch
Veröffentlicht:	Providence, Rhode Island American Mathematical Society 2020
Ausgabe:	1
Schriftenreihe:	Memoirs of the American Mathematical Society
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!