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 |
MARC
| LEADER | 00000cam a2200000Ii 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn919338525 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr mn||||||||| | ||
| 008 | 150828t20152015gw ob 001 0 eng d | ||
| 040 | |a YDXCP |b eng |e rda |e pn |c YDXCP |d OCLCO |d IDEBK |d MERUC |d EBLCP |d OCLCF |d DEBBG |d OSU |d COO |d CCO |d LOA |d UAB |d K6U |d PIFAG |d FVL |d VGM |d OCLCQ |d DEGRU |d ZCU |d U3W |d COCUF |d N$T |d IGB |d CN8ML |d STF |d SNK |d INTCL |d MHW |d BTN |d AUW |d WRM |d OCLCQ |d VTS |d ICG |d OCLCQ |d INT |d VT2 |d D6H |d OCLCQ |d WYU |d G3B |d S8I |d S8J |d S9I |d TKN |d OCLCQ |d LEAUB |d DKC |d OCLCQ |d UKAHL |d OCLCQ |d OCLCO |d OCLCQ | ||
| 066 | |c (S | ||
| 019 | |a 918555702 | ||
| 020 | |a 9783110275643 |q (electronic bk.) | ||
| 020 | |a 3110275643 |q (electronic bk.) | ||
| 020 | |a 9783110275650 |q (electronic bk.) | ||
| 020 | |a 3110275651 |q (electronic bk.) | ||
| 020 | |z 9783110275551 |q (hardback) | ||
| 020 | |z 3110275554 |q (hardback) | ||
| 020 | |z 311038129X | ||
| 020 | |z 9783110381290 |q (EPUB) | ||
| 024 | 7 | |a 10.1515/9783110275643 |2 doi | |
| 029 | 1 | |a AU@ |b 000055511352 | |
| 029 | 1 | |a CHBIS |b 011058002 | |
| 029 | 1 | |a CHVBK |b 498856313 | |
| 029 | 1 | |a DEBBG |b BV042999464 | |
| 029 | 1 | |a DEBBG |b BV044050466 | |
| 029 | 1 | |a DEBSZ |b 478007426 | |
| 029 | 1 | |a GBVCP |b 83308593X | |
| 029 | 1 | |a AU@ |b 000062594028 | |
| 029 | 1 | |a AU@ |b 000066756766 | |
| 035 | |a (OCoLC)919338525 |z (OCoLC)918555702 | ||
| 037 | |a 821110 |b MIL | ||
| 050 | 4 | |a QA9.6 |b .C46 2015 | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3/5 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Chong, C.-T. |q (Chi-Tat), |d 1949- |e author. | |
| 245 | 1 | 0 | |a Recursion theory : |b computational aspects of definability / |c Chi Tat Chong, Liang Yu. |
| 264 | 1 | |a Berlin ; |a Boston : |b Walter de Gruyter GmbH & Co., KG, |c [2015] | |
| 264 | 4 | |c ©2015 | |
| 300 | |a 1 online resource (xiii, 306 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a De Gruyter series in logic and its applications ; |v Volume 8 | |
| 504 | |a Includes bibliographical reference (pages 295-301) and index. | ||
| 505 | 0 | |a Part I: Fundamental theory -- Part II: The story of turing degrees -- Part III: Hyperarithmetic degrees and perfect set properly -- Part IV: Higher randomness theory. | |
| 588 | 0 | |a Print version record. | |
| 520 | |a 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. | ||
| 546 | |a In English. | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Recursion theory. | |
| 650 | 4 | |a Logic and Set Theory. | |
| 650 | 4 | |a Mathematics. | |
| 650 | 4 | |a Mathematik. | |
| 650 | 4 | |a Recursion theory. | |
| 650 | 6 | |a Théorie de la récursivité. | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Recursion theory. |2 fast |0 (OCoLC)fst01091982 | |
| 700 | 1 | |a Yu, Liang |c (Professor of mathematics), |e author. | |
| 776 | 0 | 8 | |i Print version: |a Chong, C.-T. (Chi-Tat), 1949- |t Recursion theory. |d Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015] |z 9783110275551 |w (DLC) 2015008883 |w (OCoLC)904420459 |
| 830 | 0 | |a De Gruyter series in logic and its applications ; |v 8. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1050258 |z Texto completo |
| 880 | 0 | 0 | |6 505-00/(S |t Frontmatter -- |t Preface -- |t Contents -- |t 1 An introduction to higher recursion theory -- |t 2 Hyperarithmetic theory -- |t 3 Admissibility and constructibility -- |t 4 The theory of Π -- |t 5 Recursion-theoretic forcing -- |t 6 Set theory -- |t 7 Classification of jump operators -- |t 8 The construction of Π -- |t 9 Independence results in recursion theory -- |t 10 Rigidity and biinterpretability of hyperdegrees -- |t 11 Basis theorems -- |t 12 Review of classical algorithmic randomness -- |t 13 More on hyperarithmetic theory -- |t 14 The theory of higher randomness -- |t A Open problems -- |t B An interview with Gerald E. Sacks -- |t C Notations and symbols -- |t Bibliography -- |t Index -- |t Backmatter. |
| 938 | |a YBP Library Services |b YANK |n 10817595 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis29825296 | ||
| 938 | |a EBSCOhost |b EBSC |n 1050258 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1787099 | ||
| 938 | |a De Gruyter |b DEGR |n 9783110275643 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH27004453 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH27004499 | ||
| 994 | |a 92 |b IZTAP | ||