Minimal degrees of unsolvability and the full approximation construction /
For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existenc...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Epstein, Richard L., 1947- |
Formato: | Tesis Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Providence :
American Mathematical Society,
1975.
|
Colección: | Memoirs of the American Mathematical Society ;
no. 162. |
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
Degrees of unsolvability /
por: Gerald E. Sacks
Publicado: (1066) -
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) -
Minimal weak truth table degrees and computably enumerable Turing degrees /
por: Downey, R. G. (Rod G.), et al.
Publicado: (2020) -
Degrees of unsolvability : local and global theory /
por: Lerman, M. (Manuel), 1943-
Publicado: (2016) -
The calculi of Lambda-conversion /
por: Alonzo Church
Publicado: (1941)