System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
This volume presents the written versions of the tutorial lectures given at the Workshop on Computational Prospects of Infinity, held from 18 June to 15 August 2005 at the Institute for Mathematical Sciences, National University of Singapore. It consists of articles by four of the leading experts in recursion theory (computability theory) and set theory. The survey paper of Rod Downey provides a comprehensive introduction to algorithmic randomness, one of the most active areas of current research in recursion theory. Theodore A Slaman's article is the first printed account of the ground-breaking work of Slaman–Woodin and Slaman–Shore on the definability of the Turing jump. John Steel presents some results on the properties of derived models of mice, and on the existence of mice with large derived models. The study was motivated by some of the well-known Holy Grails in inner model theory, including the Mouse Set Conjecture. In his presentation, W Hugh Woodin gives an outline of an expanded version (unpublished) on suitable extender sequences, a subject that was developed in the attempt to understand inner model theory for large cardinals beyond the level of superstrong cardinals.
The volume serves as a useful guide for graduate students and researchers in recursion theory and set theory to some of the most important and significant developments in these subjects in recent years.
Sample Chapter(s)
Foreword (31 KB)
Chapter 1: Five Lectures on Algorithmic Randomness (687 KB)
Contents:
- Five Lectures on Algorithmic Randomness (R Downey)
- Global Properties of the Turing Degrees and the Turing Jump (T A Slaman)
- Derived Models Associated to Mice (J R Steel)
- Tutorial Outline: Suitable Extender Sequences (W H Woodin)
Readership: Graduate students, researchers in recursion theory (computability theory) and set theory, as well as logic in general.
