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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin/Boston
De Gruyter
2015
|
| Schriftenreihe: | De Gruyter Series in Logic and Its Applications
v.8 |
| Schlagworte: | |
| Zusammenfassung: | 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 |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (322 pages) |
| ISBN: | 9783110275643 9783110275551 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV044050466 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170217s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9783110275643 |9 978-3-11-027564-3 | ||
| 020 | |a 9783110275551 |c Print |9 978-3-11-027555-1 | ||
| 035 | |a (ZDB-30-PAD)EBC1787099 | ||
| 035 | |a (ZDB-89-EBL)EBL1787099 | ||
| 035 | |a (ZDB-38-EBR)ebr11087975 | ||
| 035 | |a (OCoLC)919338525 | ||
| 035 | |a (DE-599)BVBBV044050466 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 511.35 | |
| 100 | 1 | |a Chong, Chi Tat |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Recursion Theory |b Computational Aspects of Definability |
| 264 | 1 | |a Berlin/Boston |b De Gruyter |c 2015 | |
| 264 | 4 | |c © 2015 | |
| 300 | |a 1 online resource (322 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 v.8 | |
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 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 | ||
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Algebra | |
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Recursion theory | |
| 650 | 4 | |a Recursive functions | |
| 700 | 1 | |a Yu, Liang |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Chong, Chi Tat |t Recursion Theory : Computational Aspects of Definability |
| 912 | |a ZDB-30-PAD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029457311 | ||
Datensatz im Suchindex
| _version_ | 1804177067970920448 |
|---|---|
| any_adam_object | |
| author | Chong, Chi Tat |
| author_facet | Chong, Chi Tat |
| author_role | aut |
| author_sort | Chong, Chi Tat |
| author_variant | c t c ct ctc |
| building | Verbundindex |
| bvnumber | BV044050466 |
| collection | ZDB-30-PAD |
| ctrlnum | (ZDB-30-PAD)EBC1787099 (ZDB-89-EBL)EBL1787099 (ZDB-38-EBR)ebr11087975 (OCoLC)919338525 (DE-599)BVBBV044050466 |
| dewey-full | 511.35 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.35 |
| dewey-search | 511.35 |
| dewey-sort | 3511.35 |
| 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>01921nmm a2200445zcb4500</leader><controlfield tag="001">BV044050466</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170217s2015 |||| 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">9783110275551</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-11-027555-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC1787099</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL1787099</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr11087975</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)919338525</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044050466</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.35</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chong, Chi Tat</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></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 resource (322 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">v.8</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1=" " 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="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</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, Chi Tat</subfield><subfield code="t">Recursion Theory : Computational Aspects of Definability</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PAD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029457311</subfield></datafield></record></collection> |
| id | DE-604.BV044050466 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:42:11Z |
| institution | BVB |
| isbn | 9783110275643 9783110275551 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029457311 |
| oclc_num | 919338525 |
| open_access_boolean | |
| physical | 1 online resource (322 pages) |
| psigel | ZDB-30-PAD |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | De Gruyter |
| record_format | marc |
| series2 | De Gruyter Series in Logic and Its Applications |
| spelling | Chong, Chi Tat Verfasser aut Recursion Theory Computational Aspects of Definability Berlin/Boston De Gruyter 2015 © 2015 1 online resource (322 pages) txt rdacontent c rdamedia cr rdacarrier De Gruyter Series in Logic and Its Applications v.8 Description based on publisher supplied metadata and other sources 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 Mathematik Algebra Mathematics Recursion theory Recursive functions Yu, Liang Sonstige oth Erscheint auch als Druck-Ausgabe Chong, Chi Tat Recursion Theory : Computational Aspects of Definability |
| spellingShingle | Chong, Chi Tat Recursion Theory Computational Aspects of Definability Mathematik Algebra Mathematics Recursion theory Recursive functions |
| 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 |
| title_fullStr | Recursion Theory Computational Aspects of Definability |
| title_full_unstemmed | Recursion Theory Computational Aspects of Definability |
| title_short | Recursion Theory |
| title_sort | recursion theory computational aspects of definability |
| title_sub | Computational Aspects of Definability |
| topic | Mathematik Algebra Mathematics Recursion theory Recursive functions |
| topic_facet | Mathematik Algebra Mathematics Recursion theory Recursive functions |
| work_keys_str_mv | AT chongchitat recursiontheorycomputationalaspectsofdefinability AT yuliang recursiontheorycomputationalaspectsofdefinability |