Cargando…
Recursion theory : computational aspects of definability /
This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin ; Boston :
Walter de Gruyter GmbH & Co., KG,
[2015]
|
| Colección: | De Gruyter series in logic and its applications ;
8. |
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness. |
|---|---|
| Descripción Física: | 1 online resource (xiii, 306 pages) |
| Bibliografía: | Includes bibliographical reference (pages 295-301) and index. |
| ISBN: | 9783110275643 3110275643 9783110275650 3110275651 |