Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Recursion theory : computational aspects of definability / / Chi Tat Chong, Liang Yu
| Recursion theory : computational aspects of definability / / Chi Tat Chong, Liang Yu |
| Autore | Chong C.-T (Chi-Tat), <1949-> |
| Pubbl/distr/stampa | Berlin, [Germany] ; ; Boston, [Massachusetts] : , : De Gruyter, , 2015 |
| Descrizione fisica | 1 online resource (322 p.) |
| Disciplina | 511.3/5 |
| Collana | De Gruyter Series in Logic and Its Applications |
| Soggetto topico | Recursion theory |
| Soggetto non controllato |
Higher Randomness
Hyperdegrees Jump Operator Recursion Theory Turing Degrees |
| ISBN |
3-11-038129-X
3-11-027564-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Preface -- Contents -- Part I: Fundamental theory -- 1 An introduction to higher recursion theory -- 2 Hyperarithmetic theory -- 3 Admissibility and constructibility -- 4 The theory of Π1 1-sets -- 5 Recursion-theoretic forcing -- 6 Set theory -- Part II: The story of Turing degrees -- 7 Classification of jump operators -- 8 The construction of Π1 1-sets -- 9 Independence results in recursion theory -- Part III: Hyperarithmetic degrees and perfect set property -- 10 Rigidity and bi-interpretability of hyperdegrees -- 11 Basis theorems -- Part IV: Higher randomness theory -- 12 Review of classical algorithmic randomness -- 13 More on hyperarithmetic theory -- 14 The theory of higher randomness -- A Open problems -- B An interview with Gerald E. Sacks -- C Notations and symbols -- Bibliography -- Index -- Backmatter |
| Record Nr. | UNINA-9910798084503321 |
Chong C.-T (Chi-Tat), <1949->
|
||
| Berlin, [Germany] ; ; Boston, [Massachusetts] : , : De Gruyter, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Recursion theory : computational aspects of definability / / Chi Tat Chong, Liang Yu
| Recursion theory : computational aspects of definability / / Chi Tat Chong, Liang Yu |
| Autore | Chong C.-T (Chi-Tat), <1949-> |
| Pubbl/distr/stampa | Berlin, [Germany] ; ; Boston, [Massachusetts] : , : De Gruyter, , 2015 |
| Descrizione fisica | 1 online resource (322 p.) |
| Disciplina | 511.3/5 |
| Collana | De Gruyter Series in Logic and Its Applications |
| Soggetto topico | Recursion theory |
| Soggetto non controllato |
Higher Randomness
Hyperdegrees Jump Operator Recursion Theory Turing Degrees |
| ISBN |
3-11-038129-X
3-11-027564-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Preface -- Contents -- Part I: Fundamental theory -- 1 An introduction to higher recursion theory -- 2 Hyperarithmetic theory -- 3 Admissibility and constructibility -- 4 The theory of Π1 1-sets -- 5 Recursion-theoretic forcing -- 6 Set theory -- Part II: The story of Turing degrees -- 7 Classification of jump operators -- 8 The construction of Π1 1-sets -- 9 Independence results in recursion theory -- Part III: Hyperarithmetic degrees and perfect set property -- 10 Rigidity and bi-interpretability of hyperdegrees -- 11 Basis theorems -- Part IV: Higher randomness theory -- 12 Review of classical algorithmic randomness -- 13 More on hyperarithmetic theory -- 14 The theory of higher randomness -- A Open problems -- B An interview with Gerald E. Sacks -- C Notations and symbols -- Bibliography -- Index -- Backmatter |
| Record Nr. | UNINA-9910820376703321 |
|
Chong C.-T (Chi-Tat), <1949->
|
||
| Berlin, [Germany] ; ; Boston, [Massachusetts] : , : De Gruyter, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||