Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | |
| Formato: | Electrónico Congresos, conferencias eBook |
| Idioma: | Inglés |
| Publicado: |
Singapore :
World Scientific,
©2008.
|
| Colección: | Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ;
v. 15. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn317921709 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.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 | ||
| 020 | |a 981279655X |q (electronic bk.) | ||
| 020 | |a 9789812796554 |q (electronic bk.) | ||
| 020 | |z 9812796541 |q (Cloth) | ||
| 029 | 0 | |a CDX |b 9570976 | |
| 029 | 1 | |a AU@ |b 000058361730 | |
| 029 | 1 | |a DEBBG |b BV043082385 | |
| 029 | 1 | |a DEBSZ |b 38434545X | |
| 029 | 1 | |a DEBSZ |b 42128532X | |
| 035 | |a (OCoLC)317921709 | ||
| 050 | 4 | |a QA9.6 |b .W67 2005eb | |
| 072 | 7 | |a MAT |x 028000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3 22 |2 22 |
| 049 | |a UAMI | ||
| 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. | |
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 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- | |
| 711 | 2 | |a Workshop on Computational Prospects of Infinity |d (2005 : |c Institute for Mathematical Sciences, National University of Singapore) | |
| 830 | 0 | |a Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ; |v v. 15. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=521153 |z Texto completo |
| 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 IZTAP | ||