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

Podrobná bibliografia

Hlavní autori:	Downey, Rodney G., Ng, Keng Meng, Solomon, Reed
Médium:	E-kniha Kniha
Jazyk:	English
Vydavateľské údaje:	Providence, Rhode Island American Mathematical Society 2020
Vydanie:	1
Edícia:	Memoirs of the American Mathematical Society
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!