Minimal weak truth table degrees and computably enumerable Turing degrees

Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.

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

Full description

Saved in:
Bibliographic Details
Main Authors: Downey, R. G. (Rod G.) (Author), Ng, Keng Meng (Author), Solomon, Reed (Author)
Format: eBook
Language:English
Published: Providence, RI : American Mathematical Society, [2020].
Series:Memoirs of the American Mathematical Society ; no. 1284.
Subjects:
Unsolvability (Mathematical logic)
Recursively enumerable sets.
Computable functions.
Funciones computables
Teoría de conjuntos
Computable functions
Recursively enumerable sets
Mathematical logic and foundations > Computability and recursion theory > Recursively (computably) enumerable sets and degrees.
Mathematical logic and foundations > Computability and recursion theory > Other Turing degree structures.
Mathematical logic and foundations > Computability and recursion theory > Other degrees and reducibilities.
Online Access:Click for online access
Login for hold information

‌

Click for online access

Online

Holdings details from Online
Available

Similar Items