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...
Clasificación: | Libro Electrónico |
---|---|
Autores principales: | Downey, R. G. (Rod G.) (Autor), Ng, Keng Meng (Autor), Solomon, Reed (Autor) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Providence, RI :
American Mathematical Society,
[2020].
|
Colección: | Memoirs of the American Mathematical Society ;
no. 1284. |
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability /
por: Downey, R. G. (Rod G.), et al.
Publicado: (2020) -
A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
por: Downey, Rod, et al.
Publicado: (2020) -
The role of true finiteness in the admissible recursively enumerable degrees /
por: Greenberg, Noam, 1974-
Publicado: (2006) -
Degrees of unsolvability /
por: Gerald E. Sacks
Publicado: (1066) -
Automorphisms of the lattice of recursively enumerable sets /
por: Cholak, Peter, 1962-
Publicado: (1995)