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

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Authors: Downey, R. G. (Rod G.) (Author), Ng, Keng Meng (Author), Solomon, Reed (Author)
Format: Electronic eBook
Language:Inglés
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.
Non-résolubilité (Logique mathématique)
Ensembles récursivement énumérables.
Fonctions calculables.
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:Texto completo
Table of Contents:
  • Informal construction
  • Formal construction
  • Limiting results.

Similar Items