| Description |
1 online resource : illustrations. |
| Physical Medium |
polychrome |
| Description |
text file |
| Series |
Lecture notes series / Institute for Mathematical Sciences, National University of Singapore ; v. 15
|
|
Lecture notes series (National University of Singapore. Institute for Mathematical Sciences) ; v. 15.
|
| Bibliography |
Includes bibliographical references. |
| Summary |
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. |
| 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. |
| Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
| Subject |
Recursion theory -- Congresses.
|
|
Recursion theory. |
|
Set theory -- Congresses.
|
|
Set theory. |
|
Infinite -- Congresses.
|
|
Infinite. |
| Genre/Form |
Electronic books.
|
|
Conference papers and proceedings.
|
|
Electronic books.
|
|
Conference papers and proceedings.
|
| Added Author |
Chong, C.-T. (Chi-Tat), 1949-
|
|
Workshop on Computational Prospects of Infinity (2005 : Institute for Mathematical Sciences, National University of Singapore)
|
| Added Title |
Presented talks |
| ISBN |
981279655X (electronic book) |
|
9789812796554 (electronic book) |
|
9812796541 (Cloth) |
|
