Computational prospects of infinity.: Part II, Presented talks /
This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore :
World Scientific,
©2008.
|
| Schriftenreihe: | Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ;
v. 15. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others. |
| Beschreibung: | 1 online resource : illustrations |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 981279655X 9789812796554 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn317921709 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 080319s2008 si a ob 100 0 eng d | ||
| 040 | |a CDX |b eng |e pn |c CDX |d OCLCQ |d IDEBK |d OCLCQ |d N$T |d DEBSZ |d MHW |d OCLCO |d STF |d OCLCQ |d OCLCO |d OCLCF |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d AGLDB |d OCLCQ |d VTS |d M8D |d UKAHL |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 020 | |a 981279655X |q (electronic bk.) | ||
| 020 | |a 9789812796554 |q (electronic bk.) | ||
| 020 | |z 9812796541 |q (Cloth) | ||
| 035 | |a (OCoLC)317921709 | ||
| 050 | 4 | |a QA9.6 |b .W67 2005eb | |
| 072 | 7 | |a MAT |x 028000 |2 bisacsh | |
| 082 | 7 | |a 511.3 22 |2 22 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Computational prospects of infinity. |n Part II, |p Presented talks / |c editors, Chitat Chong [and others]. |
| 246 | 3 | 0 | |a Presented talks |
| 260 | |a Singapore : |b World Scientific, |c ©2008. | ||
| 300 | |a 1 online resource : |b illustrations | ||
| 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 Lecture notes series / Institute for Mathematical Sciences, National University of Singapore ; |v v. 15 | |
| 504 | |a Includes bibliographical references. | ||
| 588 | 0 | |a Print version record. | |
| 520 | |a This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others. | ||
| 505 | 0 | |a Generating sets for the recursively enumerable turing degrees / Klaus Ambos-Spies, Steffen Lempp and Theodore A. Slaman -- Coding into H([symbol]), together (or not) with forcing axioms. A survey / David Asperó -- Nonstandard methods in Ramsey's theorem for pairs / Chi Tat Chong -- Prompt simplicity, array computability and cupping / Rod Downey [and others] -- Lowness for computable machines / Rod Downey [and others] -- A simpler short extenders forcing -- Gap 3 / Moti Gitik -- Limit computability and constructive measure / Denis R. Hirschfeldt and Sebastiaan A. Terwijn -- The strength of some combinatorial principles related to Ramsey's theorem for pairs / Denis R. Hirschfeldt [and others] -- Absoluteness for universally Baire sets and the Uncountable II / Ilijas Farah [and others] -- Monadic definability of ordinals / Itay Neeman -- A cuppable non-bounding degree / Keng Meng Ng -- Eliminating concepts / André Nies -- A lower cone in the wtt degrees of non-integral effective dimension / André Nies and Jan Reimann -- A minimal rK-degree / Alexander Raichev and Frank Stephan -- Diamonds on [symbol] / Masahiro Shioya -- Rigidity and biinterpretability in the hyperdegrees / Richard A. Shore -- Some fundamental issues concerning degrees of unsolvability / Stephen G. Simpson -- Weak determinacy and iterations of inductive definitions / MedYahya Ould MedSalem and Kazuyuki Tanaka -- A tt version of the Posner-Robinson theorem / W. Hugh Woodin -- Cupping computably enumerable degrees in the Ershov hierarchy / Guohua Wu. | |
| 650 | 0 | |a Recursion theory |v Congresses. | |
| 650 | 0 | |a Set theory |v Congresses. | |
| 650 | 0 | |a Infinite |v Congresses. | |
| 650 | 6 | |a Théorie de la récursivité |v Congrès. | |
| 650 | 6 | |a Théorie des ensembles |v Congrès. | |
| 650 | 6 | |a Infini |v Congrès. | |
| 650 | 7 | |a MATHEMATICS |x Set Theory. |2 bisacsh | |
| 650 | 7 | |a Infinite |2 fast | |
| 650 | 7 | |a Recursion theory |2 fast | |
| 650 | 7 | |a Set theory |2 fast | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Chong, C.-T. |q (Chi-Tat), |d 1949- |0 http://id.loc.gov/authorities/names/n83161355 | |
| 711 | 2 | |a Workshop on Computational Prospects of Infinity |d (2005 : |c Institute for Mathematical Sciences, National University of Singapore) |0 http://id.loc.gov/authorities/names/no2008158736 | |
| 758 | |i has work: |a Computational prospects of infinity Part II Presented talks (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFMWVb7M8RwwftkCC36xWC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 830 | 0 | |a Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ; |v v. 15. |0 http://id.loc.gov/authorities/names/no2003042729 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=521153 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24685276 | ||
| 938 | |a Coutts Information Services |b COUT |n 9570976 | ||
| 938 | |a EBSCOhost |b EBSC |n 521153 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 195596 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn317921709 |
|---|---|
| _version_ | 1816881690062094336 |
| adam_text | |
| any_adam_object | |
| author2 | Chong, C.-T. (Chi-Tat), 1949- |
| author2_role | |
| author2_variant | c t c ctc |
| author_GND | http://id.loc.gov/authorities/names/n83161355 |
| author_corporate | Workshop on Computational Prospects of Infinity |
| author_corporate_role | |
| author_facet | Chong, C.-T. (Chi-Tat), 1949- Workshop on Computational Prospects of Infinity |
| author_sort | Chong, C.-T. 1949- |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.6 .W67 2005eb |
| callnumber-search | QA9.6 .W67 2005eb |
| callnumber-sort | QA 19.6 W67 42005EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Generating sets for the recursively enumerable turing degrees / Klaus Ambos-Spies, Steffen Lempp and Theodore A. Slaman -- Coding into H([symbol]), together (or not) with forcing axioms. A survey / David Asperó -- Nonstandard methods in Ramsey's theorem for pairs / Chi Tat Chong -- Prompt simplicity, array computability and cupping / Rod Downey [and others] -- Lowness for computable machines / Rod Downey [and others] -- A simpler short extenders forcing -- Gap 3 / Moti Gitik -- Limit computability and constructive measure / Denis R. Hirschfeldt and Sebastiaan A. Terwijn -- The strength of some combinatorial principles related to Ramsey's theorem for pairs / Denis R. Hirschfeldt [and others] -- Absoluteness for universally Baire sets and the Uncountable II / Ilijas Farah [and others] -- Monadic definability of ordinals / Itay Neeman -- A cuppable non-bounding degree / Keng Meng Ng -- Eliminating concepts / André Nies -- A lower cone in the wtt degrees of non-integral effective dimension / André Nies and Jan Reimann -- A minimal rK-degree / Alexander Raichev and Frank Stephan -- Diamonds on [symbol] / Masahiro Shioya -- Rigidity and biinterpretability in the hyperdegrees / Richard A. Shore -- Some fundamental issues concerning degrees of unsolvability / Stephen G. Simpson -- Weak determinacy and iterations of inductive definitions / MedYahya Ould MedSalem and Kazuyuki Tanaka -- A tt version of the Posner-Robinson theorem / W. Hugh Woodin -- Cupping computably enumerable degrees in the Ershov hierarchy / Guohua Wu. |
| ctrlnum | (OCoLC)317921709 |
| dewey-full | 511.322 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 22 |
| dewey-search | 511.3 22 |
| dewey-sort | 3511.3 222 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04896cam a2200601 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn317921709</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">080319s2008 si a ob 100 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">CDX</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">CDX</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">MHW</subfield><subfield code="d">OCLCO</subfield><subfield code="d">STF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">AGLDB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">981279655X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812796554</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9812796541</subfield><subfield code="q">(Cloth)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)317921709</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.6</subfield><subfield code="b">.W67 2005eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">028000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3 22</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Computational prospects of infinity.</subfield><subfield code="n">Part II,</subfield><subfield code="p">Presented talks /</subfield><subfield code="c">editors, Chitat Chong [and others].</subfield></datafield><datafield tag="246" ind1="3" ind2="0"><subfield code="a">Presented talks</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2008.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource :</subfield><subfield code="b">illustrations</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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes series / Institute for Mathematical Sciences, National University of Singapore ;</subfield><subfield code="v">v. 15</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Generating sets for the recursively enumerable turing degrees / Klaus Ambos-Spies, Steffen Lempp and Theodore A. Slaman -- Coding into H([symbol]), together (or not) with forcing axioms. A survey / David Asperó -- Nonstandard methods in Ramsey's theorem for pairs / Chi Tat Chong -- Prompt simplicity, array computability and cupping / Rod Downey [and others] -- Lowness for computable machines / Rod Downey [and others] -- A simpler short extenders forcing -- Gap 3 / Moti Gitik -- Limit computability and constructive measure / Denis R. Hirschfeldt and Sebastiaan A. Terwijn -- The strength of some combinatorial principles related to Ramsey's theorem for pairs / Denis R. Hirschfeldt [and others] -- Absoluteness for universally Baire sets and the Uncountable II / Ilijas Farah [and others] -- Monadic definability of ordinals / Itay Neeman -- A cuppable non-bounding degree / Keng Meng Ng -- Eliminating concepts / André Nies -- A lower cone in the wtt degrees of non-integral effective dimension / André Nies and Jan Reimann -- A minimal rK-degree / Alexander Raichev and Frank Stephan -- Diamonds on [symbol] / Masahiro Shioya -- Rigidity and biinterpretability in the hyperdegrees / Richard A. Shore -- Some fundamental issues concerning degrees of unsolvability / Stephen G. Simpson -- Weak determinacy and iterations of inductive definitions / MedYahya Ould MedSalem and Kazuyuki Tanaka -- A tt version of the Posner-Robinson theorem / W. Hugh Woodin -- Cupping computably enumerable degrees in the Ershov hierarchy / Guohua Wu.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursion theory</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Set theory</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Infinite</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie de la récursivité</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des ensembles</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Infini</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Set Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Infinite</subfield><subfield code="2">fast</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="7"><subfield code="a">Set theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Conference papers and proceedings</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chong, C.-T.</subfield><subfield code="q">(Chi-Tat),</subfield><subfield code="d">1949-</subfield><subfield code="0">http://id.loc.gov/authorities/names/n83161355</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">Workshop on Computational Prospects of Infinity</subfield><subfield code="d">(2005 :</subfield><subfield code="c">Institute for Mathematical Sciences, National University of Singapore)</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2008158736</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Computational prospects of infinity Part II Presented talks (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFMWVb7M8RwwftkCC36xWC</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ;</subfield><subfield code="v">v. 15.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2003042729</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=521153</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24685276</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">9570976</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">521153</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">195596</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Conference papers and proceedings fast |
| genre_facet | Conference papers and proceedings |
| id | ZDB-4-EBA-ocn317921709 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:43Z |
| institution | BVB |
| institution_GND | http://id.loc.gov/authorities/names/no2008158736 |
| isbn | 981279655X 9789812796554 |
| language | English |
| oclc_num | 317921709 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | World Scientific, |
| record_format | marc |
| series | Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ; |
| series2 | Lecture notes series / Institute for Mathematical Sciences, National University of Singapore ; |
| spelling | Computational prospects of infinity. Part II, Presented talks / editors, Chitat Chong [and others]. Presented talks Singapore : World Scientific, ©2008. 1 online resource : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Lecture notes series / Institute for Mathematical Sciences, National University of Singapore ; v. 15 Includes bibliographical references. Print version record. This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others. Generating sets for the recursively enumerable turing degrees / Klaus Ambos-Spies, Steffen Lempp and Theodore A. Slaman -- Coding into H([symbol]), together (or not) with forcing axioms. A survey / David Asperó -- Nonstandard methods in Ramsey's theorem for pairs / Chi Tat Chong -- Prompt simplicity, array computability and cupping / Rod Downey [and others] -- Lowness for computable machines / Rod Downey [and others] -- A simpler short extenders forcing -- Gap 3 / Moti Gitik -- Limit computability and constructive measure / Denis R. Hirschfeldt and Sebastiaan A. Terwijn -- The strength of some combinatorial principles related to Ramsey's theorem for pairs / Denis R. Hirschfeldt [and others] -- Absoluteness for universally Baire sets and the Uncountable II / Ilijas Farah [and others] -- Monadic definability of ordinals / Itay Neeman -- A cuppable non-bounding degree / Keng Meng Ng -- Eliminating concepts / André Nies -- A lower cone in the wtt degrees of non-integral effective dimension / André Nies and Jan Reimann -- A minimal rK-degree / Alexander Raichev and Frank Stephan -- Diamonds on [symbol] / Masahiro Shioya -- Rigidity and biinterpretability in the hyperdegrees / Richard A. Shore -- Some fundamental issues concerning degrees of unsolvability / Stephen G. Simpson -- Weak determinacy and iterations of inductive definitions / MedYahya Ould MedSalem and Kazuyuki Tanaka -- A tt version of the Posner-Robinson theorem / W. Hugh Woodin -- Cupping computably enumerable degrees in the Ershov hierarchy / Guohua Wu. Recursion theory Congresses. Set theory Congresses. Infinite Congresses. Théorie de la récursivité Congrès. Théorie des ensembles Congrès. Infini Congrès. MATHEMATICS Set Theory. bisacsh Infinite fast Recursion theory fast Set theory fast Conference papers and proceedings fast Chong, C.-T. (Chi-Tat), 1949- http://id.loc.gov/authorities/names/n83161355 Workshop on Computational Prospects of Infinity (2005 : Institute for Mathematical Sciences, National University of Singapore) http://id.loc.gov/authorities/names/no2008158736 has work: Computational prospects of infinity Part II Presented talks (Text) https://id.oclc.org/worldcat/entity/E39PCFMWVb7M8RwwftkCC36xWC https://id.oclc.org/worldcat/ontology/hasWork Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ; v. 15. http://id.loc.gov/authorities/names/no2003042729 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=521153 Volltext |
| spellingShingle | Computational prospects of infinity. Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ; Generating sets for the recursively enumerable turing degrees / Klaus Ambos-Spies, Steffen Lempp and Theodore A. Slaman -- Coding into H([symbol]), together (or not) with forcing axioms. A survey / David Asperó -- Nonstandard methods in Ramsey's theorem for pairs / Chi Tat Chong -- Prompt simplicity, array computability and cupping / Rod Downey [and others] -- Lowness for computable machines / Rod Downey [and others] -- A simpler short extenders forcing -- Gap 3 / Moti Gitik -- Limit computability and constructive measure / Denis R. Hirschfeldt and Sebastiaan A. Terwijn -- The strength of some combinatorial principles related to Ramsey's theorem for pairs / Denis R. Hirschfeldt [and others] -- Absoluteness for universally Baire sets and the Uncountable II / Ilijas Farah [and others] -- Monadic definability of ordinals / Itay Neeman -- A cuppable non-bounding degree / Keng Meng Ng -- Eliminating concepts / André Nies -- A lower cone in the wtt degrees of non-integral effective dimension / André Nies and Jan Reimann -- A minimal rK-degree / Alexander Raichev and Frank Stephan -- Diamonds on [symbol] / Masahiro Shioya -- Rigidity and biinterpretability in the hyperdegrees / Richard A. Shore -- Some fundamental issues concerning degrees of unsolvability / Stephen G. Simpson -- Weak determinacy and iterations of inductive definitions / MedYahya Ould MedSalem and Kazuyuki Tanaka -- A tt version of the Posner-Robinson theorem / W. Hugh Woodin -- Cupping computably enumerable degrees in the Ershov hierarchy / Guohua Wu. Recursion theory Congresses. Set theory Congresses. Infinite Congresses. Théorie de la récursivité Congrès. Théorie des ensembles Congrès. Infini Congrès. MATHEMATICS Set Theory. bisacsh Infinite fast Recursion theory fast Set theory fast |
| title | Computational prospects of infinity. |
| title_alt | Presented talks |
| title_auth | Computational prospects of infinity. |
| title_exact_search | Computational prospects of infinity. |
| title_full | Computational prospects of infinity. Part II, Presented talks / editors, Chitat Chong [and others]. |
| title_fullStr | Computational prospects of infinity. Part II, Presented talks / editors, Chitat Chong [and others]. |
| title_full_unstemmed | Computational prospects of infinity. Part II, Presented talks / editors, Chitat Chong [and others]. |
| title_short | Computational prospects of infinity. |
| title_sort | computational prospects of infinity presented talks |
| topic | Recursion theory Congresses. Set theory Congresses. Infinite Congresses. Théorie de la récursivité Congrès. Théorie des ensembles Congrès. Infini Congrès. MATHEMATICS Set Theory. bisacsh Infinite fast Recursion theory fast Set theory fast |
| topic_facet | Recursion theory Congresses. Set theory Congresses. Infinite Congresses. Théorie de la récursivité Congrès. Théorie des ensembles Congrès. Infini Congrès. MATHEMATICS Set Theory. Infinite Recursion theory Set theory Conference papers and proceedings |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=521153 |
| work_keys_str_mv | AT chongct computationalprospectsofinfinitypartii AT workshoponcomputationalprospectsofinfinityinstituteformathematicalsciencesnationaluniversityofsingapore computationalprospectsofinfinitypartii AT chongct presentedtalks AT workshoponcomputationalprospectsofinfinityinstituteformathematicalsciencesnationaluniversityofsingapore presentedtalks |