Recursion Theory : : Computational Aspects of Definability / / Chi Tat Chong, Liang Yu.

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. 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 techniques and ideas f...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter DG Plus DeG Package 2015 Part 1
VerfasserIn:
Place / Publishing House:Berlin ;, Boston : : De Gruyter, , [2015]
©2015
Year of Publication:2015
Language:English
Series:De Gruyter Series in Logic and Its Applications , 8
Online Access:
Physical Description:1 online resource (306 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9783110275643
ctrlnum (DE-B1597)174868
(OCoLC)919182882
collection bib_alma
record_format marc
spelling Chong, Chi Tat, author. aut http://id.loc.gov/vocabulary/relators/aut
Recursion Theory : Computational Aspects of Definability / Chi Tat Chong, Liang Yu.
Berlin ; Boston : De Gruyter, [2015]
©2015
1 online resource (306 p.)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
De Gruyter Series in Logic and Its Applications , 1438-1893 ; 8
Frontmatter -- Preface -- Contents -- Part I: Fundamental theory -- 1 An introduction to higher recursion theory -- 2 Hyperarithmetic theory -- 3 Admissibility and constructibility -- 4 The theory of Π11-sets -- 5 Recursion-theoretic forcing -- 6 Set theory -- Part II: The story of Turing degrees -- 7 Classification of jump operators -- 8 The construction of Π11-sets -- 9 Independence results in recursion theory -- Part III: Hyperarithmetic degrees and perfect set property -- 10 Rigidity and biinterpretability 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
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. 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 techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023)
Recursion theory.
Higher Randomness.
Hypergrade.
Jump Operator.
Rekursionstheorie.
Turinggrade.
MATHEMATICS / Applied. bisacsh
Hyperdegrees.
Recursion Theory.
Turing Degrees.
Yu, Liang, author. aut http://id.loc.gov/vocabulary/relators/aut
Title is part of eBook package: De Gruyter DG Plus DeG Package 2015 Part 1 9783110762518
Title is part of eBook package: De Gruyter DG Plus eBook-Package 2015 9783110700985
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2015 9783110439687 ZDB-23-DGG
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2015 9783110438765 ZDB-23-DMA
EPUB 9783110381290
print 9783110275551
https://doi.org/10.1515/9783110275643
https://www.degruyter.com/isbn/9783110275643
Cover https://www.degruyter.com/document/cover/isbn/9783110275643/original
language English
format eBook
author Chong, Chi Tat,
Chong, Chi Tat,
Yu, Liang,
spellingShingle Chong, Chi Tat,
Chong, Chi Tat,
Yu, Liang,
Recursion Theory : Computational Aspects of Definability /
De Gruyter Series in Logic and Its Applications ,
Frontmatter --
Preface --
Contents --
Part I: Fundamental theory --
1 An introduction to higher recursion theory --
2 Hyperarithmetic theory --
3 Admissibility and constructibility --
4 The theory of Π11-sets --
5 Recursion-theoretic forcing --
6 Set theory --
Part II: The story of Turing degrees --
7 Classification of jump operators --
8 The construction of Π11-sets --
9 Independence results in recursion theory --
Part III: Hyperarithmetic degrees and perfect set property --
10 Rigidity and biinterpretability 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
author_facet Chong, Chi Tat,
Chong, Chi Tat,
Yu, Liang,
Yu, Liang,
Yu, Liang,
author_variant c t c ct ctc
c t c ct ctc
l y ly
author_role VerfasserIn
VerfasserIn
VerfasserIn
author2 Yu, Liang,
Yu, Liang,
author2_variant l y ly
author2_role VerfasserIn
VerfasserIn
author_sort Chong, Chi Tat,
title Recursion Theory : Computational Aspects of Definability /
title_sub 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_auth Recursion Theory : Computational Aspects of Definability /
title_alt Frontmatter --
Preface --
Contents --
Part I: Fundamental theory --
1 An introduction to higher recursion theory --
2 Hyperarithmetic theory --
3 Admissibility and constructibility --
4 The theory of Π11-sets --
5 Recursion-theoretic forcing --
6 Set theory --
Part II: The story of Turing degrees --
7 Classification of jump operators --
8 The construction of Π11-sets --
9 Independence results in recursion theory --
Part III: Hyperarithmetic degrees and perfect set property --
10 Rigidity and biinterpretability 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
title_new Recursion Theory :
title_sort recursion theory : computational aspects of definability /
series De Gruyter Series in Logic and Its Applications ,
series2 De Gruyter Series in Logic and Its Applications ,
publisher De Gruyter,
publishDate 2015
physical 1 online resource (306 p.)
Issued also in print.
contents Frontmatter --
Preface --
Contents --
Part I: Fundamental theory --
1 An introduction to higher recursion theory --
2 Hyperarithmetic theory --
3 Admissibility and constructibility --
4 The theory of Π11-sets --
5 Recursion-theoretic forcing --
6 Set theory --
Part II: The story of Turing degrees --
7 Classification of jump operators --
8 The construction of Π11-sets --
9 Independence results in recursion theory --
Part III: Hyperarithmetic degrees and perfect set property --
10 Rigidity and biinterpretability 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
isbn 9783110275643
9783110762518
9783110700985
9783110439687
9783110438765
9783110381290
9783110275551
issn 1438-1893 ;
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA9
callnumber-sort QA 19.6
url https://doi.org/10.1515/9783110275643
https://www.degruyter.com/isbn/9783110275643
https://www.degruyter.com/document/cover/isbn/9783110275643/original
illustrated Not Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.35
dewey-sort 3511.35
dewey-raw 511.35
dewey-search 511.35
doi_str_mv 10.1515/9783110275643
oclc_num 919182882
work_keys_str_mv AT chongchitat recursiontheorycomputationalaspectsofdefinability
AT yuliang recursiontheorycomputationalaspectsofdefinability
status_str n
ids_txt_mv (DE-B1597)174868
(OCoLC)919182882
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter DG Plus DeG Package 2015 Part 1
Title is part of eBook package: De Gruyter DG Plus eBook-Package 2015
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2015
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2015
is_hierarchy_title Recursion Theory : Computational Aspects of Definability /
container_title Title is part of eBook package: De Gruyter DG Plus DeG Package 2015 Part 1
author2_original_writing_str_mv noLinkedField
noLinkedField
_version_ 1770177500547121152
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05042nam a22009375i 4500</leader><controlfield tag="001">9783110275643</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20230228123812.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">230228t20152015gw fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)919338525</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110275643</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">(DE-B1597)174868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)919182882</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.6</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="8">1u</subfield><subfield code="a">511.35</subfield><subfield code="q">DE-101</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chong, Chi Tat, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/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 ;</subfield><subfield code="a">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 (306 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">De Gruyter Series in Logic and Its Applications ,</subfield><subfield code="x">1438-1893 ;</subfield><subfield code="v">8</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Part I: Fundamental theory -- </subfield><subfield code="t">1 An introduction to higher recursion theory -- </subfield><subfield code="t">2 Hyperarithmetic theory -- </subfield><subfield code="t">3 Admissibility and constructibility -- </subfield><subfield code="t">4 The theory of Π11-sets -- </subfield><subfield code="t">5 Recursion-theoretic forcing -- </subfield><subfield code="t">6 Set theory -- </subfield><subfield code="t">Part II: The story of Turing degrees -- </subfield><subfield code="t">7 Classification of jump operators -- </subfield><subfield code="t">8 The construction of Π11-sets -- </subfield><subfield code="t">9 Independence results in recursion theory -- </subfield><subfield code="t">Part III: Hyperarithmetic degrees and perfect set property -- </subfield><subfield code="t">10 Rigidity and biinterpretability of hyperdegrees -- </subfield><subfield code="t">11 Basis theorems -- </subfield><subfield code="t">Part IV: Higher randomness theory -- </subfield><subfield code="t">12 Review of classical algorithmic randomness -- </subfield><subfield code="t">13 More on hyperarithmetic theory -- </subfield><subfield code="t">14 The theory of higher randomness -- </subfield><subfield code="t">A Open problems -- </subfield><subfield code="t">B An interview with Gerald E. Sacks -- </subfield><subfield code="t">C Notations and symbols -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index -- </subfield><subfield code="t">Backmatter</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. 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 techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursion theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Higher Randomness.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypergrade.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Jump Operator.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rekursionstheorie.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turinggrade.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Applied.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Higher Randomness.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hyperdegrees.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Jump Operator.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursion Theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Turing Degrees.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, Liang, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DG Plus DeG Package 2015 Part 1</subfield><subfield code="z">9783110762518</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DG Plus eBook-Package 2015</subfield><subfield code="z">9783110700985</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2015</subfield><subfield code="z">9783110439687</subfield><subfield code="o">ZDB-23-DGG</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Mathematics 2015</subfield><subfield code="z">9783110438765</subfield><subfield code="o">ZDB-23-DMA</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">EPUB</subfield><subfield code="z">9783110381290</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9783110275551</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110275643</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9783110275643</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9783110275643/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-070098-5 DG Plus eBook-Package 2015</subfield><subfield code="b">2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-076251-8 DG Plus DeG Package 2015 Part 1</subfield><subfield code="b">2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield><subfield code="b">2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DMA</subfield><subfield code="b">2015</subfield></datafield></record></collection>