Recursion theory: computational aspects of definability
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin ; Boston
Walter de Gruyter GmbH & Co., KG
[2015]
|
| Series: | De Gruyter series in logic and its applications
8 |
| Subjects: | |
| Item Description: | Print version record |
| Physical Description: | 1 online resource (xiii, 306 pages) |
| ISBN: | 9783110275643 3110275643 9783110275650 3110275651 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045351302 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 181210s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9783110275643 |9 978-3-11-027564-3 | ||
| 020 | |a 3110275643 |9 3-11-027564-3 | ||
| 020 | |a 9783110275650 |9 978-3-11-027565-0 | ||
| 020 | |a 3110275651 |9 3-11-027565-1 | ||
| 035 | |a (ZDB-4-ITC)ocn919338525 | ||
| 035 | |a (OCoLC)919338525 | ||
| 035 | |a (DE-599)BVBBV045351302 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 511.3/5 |2 23 | |
| 100 | 1 | |a Chong, C.-T. |d 1949- |e Verfasser |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 Walter de Gruyter GmbH & Co., KG |c [2015] | |
| 264 | 4 | |c 2015 | |
| 300 | |a 1 online resource (xiii, 306 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a De Gruyter series in logic and its applications |v 8 | |
| 500 | |a Print version record | ||
| 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 | 7 | |a MATHEMATICS / General |2 bisacsh | |
| 650 | 7 | |a Recursion theory |2 fast | |
| 650 | 4 | |a Recursion theory | |
| 700 | 1 | |a Yu, Liang |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Chong, C.-T. (Chi-Tat), 1949- |t Recursion theory |d Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015] |z 9783110275551 |
| 912 | |a ZDB-4-ITC | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030737955 | ||
Record in the Search Index
| _version_ | 1804179176644673536 |
|---|---|
| any_adam_object | |
| author | Chong, C.-T. 1949- |
| author_facet | Chong, C.-T. 1949- |
| author_role | aut |
| author_sort | Chong, C.-T. 1949- |
| author_variant | c t c ctc |
| building | Verbundindex |
| bvnumber | BV045351302 |
| collection | ZDB-4-ITC |
| 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 | (ZDB-4-ITC)ocn919338525 (OCoLC)919338525 (DE-599)BVBBV045351302 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01983nmm a2200433zcb4500</leader><controlfield tag="001">BV045351302</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">181210s2015 |||| o||u| ||||||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">3110275643</subfield><subfield code="9">3-11-027564-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110275650</subfield><subfield code="9">978-3-11-027565-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3110275651</subfield><subfield code="9">3-11-027565-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-4-ITC)ocn919338525</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)919338525</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045351302</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="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chong, C.-T.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</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">Walter de Gruyter GmbH & Co., KG</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 resource (xiii, 306 pages)</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="0" ind2=" "><subfield code="a">De Gruyter series in logic and its applications</subfield><subfield code="v">8</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Print version record</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="7"><subfield code="a">MATHEMATICS / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursion theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, Liang</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Chong, C.-T. (Chi-Tat), 1949-</subfield><subfield code="t">Recursion theory</subfield><subfield code="d">Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015]</subfield><subfield code="z">9783110275551</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-ITC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030737955</subfield></datafield></record></collection> |
| id | DE-604.BV045351302 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:15:42Z |
| institution | BVB |
| isbn | 9783110275643 3110275643 9783110275650 3110275651 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030737955 |
| oclc_num | 919338525 |
| open_access_boolean | |
| physical | 1 online resource (xiii, 306 pages) |
| psigel | ZDB-4-ITC |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Walter de Gruyter GmbH & Co., KG |
| record_format | marc |
| series2 | De Gruyter series in logic and its applications |
| spelling | Chong, C.-T. 1949- Verfasser aut Recursion theory computational aspects of definability Chi Tat Chong, Liang Yu Berlin ; Boston Walter de Gruyter GmbH & Co., KG [2015] 2015 1 online resource (xiii, 306 pages) txt rdacontent c rdamedia cr rdacarrier De Gruyter series in logic and its applications 8 Print version record 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 MATHEMATICS / General bisacsh Recursion theory fast Recursion theory Yu, Liang Sonstige oth Erscheint auch als Druck-Ausgabe Chong, C.-T. (Chi-Tat), 1949- Recursion theory Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015] 9783110275551 |
| spellingShingle | Chong, C.-T. 1949- 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 theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness MATHEMATICS / General bisacsh Recursion theory fast 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 | MATHEMATICS / General bisacsh Recursion theory fast Recursion theory |
| topic_facet | MATHEMATICS / General Recursion theory |
| work_keys_str_mv | AT chongct recursiontheorycomputationalaspectsofdefinability AT yuliang recursiontheorycomputationalaspectsofdefinability |