Recursion Theory: Computational Aspects of Definability
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin/Boston
De Gruyter
[2015]
|
| Schriftenreihe: | De Gruyter Series in Logic and Its Applications
8 |
| Schlagworte: | |
| Online-Zugang: | DE-898 DE-91 DE-739 DE-1043 URL des Erstveröffentlichers |
| Beschreibung: | 1 Online-Ressource (XIV, 306 Seiten) Illustrationen |
| ISBN: | 9783110275643 9783110275551 9783110275650 |
| DOI: | 10.1515/9783110275643 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042999464 | ||
| 003 | DE-604 | ||
| 005 | 20170203 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151111s2015 xx a||| o|||| 00||| eng d | ||
| 020 | |a 9783110275643 |9 978-3-11-027564-3 | ||
| 020 | |a 9783110275551 |c Print |9 978-3-11-027555-1 | ||
| 020 | |a 9783110275650 |c Print+Online |9 978-3-11-027565-0 | ||
| 024 | 7 | |a 10.1515/9783110275643 |2 doi | |
| 035 | |a (OCoLC)919338525 | ||
| 035 | |a (DE-599)BVBBV042999464 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-859 |a DE-860 |a DE-898 |a DE-739 |a DE-739 |a DE-1046 |a DE-1043 |a DE-1043 |a DE-858 | ||
| 082 | 0 | |a 690.1 |2 23 | |
| 100 | 1 | |a Chong, Chi-Tat |4 aut | |
| 245 | 1 | 0 | |a Recursion Theory |b Computational Aspects of Definability |c Chi Tat Chong, Liang Yu |
| 264 | 1 | |a Berlin/Boston |b De Gruyter |c [2015] | |
| 264 | 4 | |c © 2015 | |
| 300 | |a 1 Online-Ressource (XIV, 306 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a De Gruyter Series in Logic and Its Applications |v 8 | |
| 505 | 8 | |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 | ||
| 650 | 4 | |a Logic and Set Theory | |
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Recursion theory | |
| 650 | 4 | |a Mathematik | |
| 700 | 1 | |a Yu, Liang |4 aut | |
| 830 | 0 | |a De Gruyter Series in Logic and Its Applications |v 8 |w (DE-604)BV042002258 |9 8 | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9783110275643 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-23-DGG | ||
| 912 | |a ZDB-23-DMA | ||
| 940 | 1 | |q ZDB-23-DMA15 | |
| 940 | 1 | |q FUB_PDA_DGG | |
| 940 | 1 | |q FKE_PDA_DGG | |
| 940 | 1 | |q FLA_PDA_DGG | |
| 940 | 1 | |q UPA_PDA_DGG | |
| 940 | 1 | |q FAW_PDA_DGG | |
| 940 | 1 | |q FCO_PDA_DGG | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-028424715 | |
| 966 | e | |u https://doi.org/10.1515/9783110275643 |l DE-898 |p ZDB-23-DMA |q ZDB-23-DMA15 |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110275643 |l DE-91 |p ZDB-23-DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110275643 |l DE-739 |p ZDB-23-DGG |q UPA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110275643 |l DE-1043 |p ZDB-23-DGG |q FAB_PDA_DGG |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1824408225735245824 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Chong, Chi-Tat Yu, Liang |
| author_facet | Chong, Chi-Tat Yu, Liang |
| author_role | aut aut |
| author_sort | Chong, Chi-Tat |
| author_variant | c t c ctc l y ly |
| building | Verbundindex |
| bvnumber | BV042999464 |
| collection | ZDB-23-DGG ZDB-23-DMA |
| contents | 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 |
| ctrlnum | (OCoLC)919338525 (DE-599)BVBBV042999464 |
| dewey-full | 690.1 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 690 - Construction of buildings |
| dewey-raw | 690.1 |
| dewey-search | 690.1 |
| dewey-sort | 3690.1 |
| dewey-tens | 690 - Construction of buildings |
| discipline | Bauingenieurwesen |
| doi_str_mv | 10.1515/9783110275643 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV042999464</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170203</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151111s2015 xx a||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110275643</subfield><subfield code="9">978-3-11-027564-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110275551</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-11-027555-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110275650</subfield><subfield code="c">Print+Online</subfield><subfield code="9">978-3-11-027565-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110275643</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)919338525</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042999464</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-1043</subfield><subfield code="a">DE-1043</subfield><subfield code="a">DE-858</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">690.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chong, Chi-Tat</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursion Theory</subfield><subfield code="b">Computational Aspects of Definability</subfield><subfield code="c">Chi Tat Chong, Liang Yu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin/Boston</subfield><subfield code="b">De Gruyter</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 306 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">De Gruyter Series in Logic and Its Applications</subfield><subfield code="v">8</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic and Set Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, Liang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">De Gruyter Series in Logic and Its Applications</subfield><subfield code="v">8</subfield><subfield code="w">(DE-604)BV042002258</subfield><subfield code="9">8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110275643</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DMA</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-23-DMA15</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FUB_PDA_DGG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FKE_PDA_DGG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FLA_PDA_DGG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UPA_PDA_DGG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FAW_PDA_DGG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FCO_PDA_DGG</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028424715</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9783110275643</subfield><subfield code="l">DE-898</subfield><subfield code="p">ZDB-23-DMA</subfield><subfield code="q">ZDB-23-DMA15</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9783110275643</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9783110275643</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9783110275643</subfield><subfield code="l">DE-1043</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAB_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV042999464 |
| illustrated | Illustrated |
| indexdate | 2025-02-18T15:07:47Z |
| institution | BVB |
| isbn | 9783110275643 9783110275551 9783110275650 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028424715 |
| oclc_num | 919338525 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-859 DE-860 DE-898 DE-BY-UBR DE-739 DE-739 DE-1046 DE-1043 DE-1043 DE-858 |
| owner_facet | DE-91 DE-BY-TUM DE-859 DE-860 DE-898 DE-BY-UBR DE-739 DE-739 DE-1046 DE-1043 DE-1043 DE-858 |
| physical | 1 Online-Ressource (XIV, 306 Seiten) Illustrationen |
| psigel | ZDB-23-DGG ZDB-23-DMA ZDB-23-DMA15 FUB_PDA_DGG FKE_PDA_DGG FLA_PDA_DGG UPA_PDA_DGG FAW_PDA_DGG FCO_PDA_DGG ZDB-23-DMA ZDB-23-DMA15 ZDB-23-DGG UPA_PDA_DGG ZDB-23-DGG FAB_PDA_DGG |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | De Gruyter |
| record_format | marc |
| series | De Gruyter Series in Logic and Its Applications |
| series2 | De Gruyter Series in Logic and Its Applications |
| spelling | Chong, Chi-Tat aut Recursion Theory Computational Aspects of Definability Chi Tat Chong, Liang Yu Berlin/Boston De Gruyter [2015] © 2015 1 Online-Ressource (XIV, 306 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier De Gruyter Series in Logic and Its Applications 8 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 In English Logic and Set Theory Mathematics Mathematik Recursion theory Yu, Liang aut De Gruyter Series in Logic and Its Applications 8 (DE-604)BV042002258 8 https://doi.org/10.1515/9783110275643 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Chong, Chi-Tat Yu, Liang Recursion Theory Computational Aspects of Definability De Gruyter Series in Logic and Its Applications 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 Logic and Set Theory Mathematics Mathematik Recursion theory |
| title | Recursion Theory Computational Aspects of Definability |
| title_auth | Recursion Theory Computational Aspects of Definability |
| title_exact_search | Recursion Theory Computational Aspects of Definability |
| title_full | Recursion Theory Computational Aspects of Definability Chi Tat Chong, Liang Yu |
| title_fullStr | Recursion Theory Computational Aspects of Definability Chi Tat Chong, Liang Yu |
| title_full_unstemmed | Recursion Theory Computational Aspects of Definability Chi Tat Chong, Liang Yu |
| title_short | Recursion Theory |
| title_sort | recursion theory computational aspects of definability |
| title_sub | Computational Aspects of Definability |
| topic | Logic and Set Theory Mathematics Mathematik Recursion theory |
| topic_facet | Logic and Set Theory Mathematics Mathematik Recursion theory |
| url | https://doi.org/10.1515/9783110275643 |
| volume_link | (DE-604)BV042002258 |
| work_keys_str_mv | AT chongchitat recursiontheorycomputationalaspectsofdefinability AT yuliang recursiontheorycomputationalaspectsofdefinability |