Computational Prospects of Infinity I and II

Omar_Absi

New Member
السلام عليكم
18643.imgcache.jpg


Computational Prospects Of Infinity - Part I: Tutorials (Lecture Notes)
By Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, Yue Yang




  • Publisher: World Scientific Publishing Company
  • Number Of Pages: 264
  • Publication Date: 2008-05-02
  • ISBN-10 / ASIN: 9812796533
  • ISBN-13 / EAN: 9789812796530
  • Binding: Hardcover




Product Description:

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.

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).







DOWNLOAD
 


18654.imgcache.jpg


Computational Prospects of Infinity II: Presented Talks (Lecture Notes Series, Institute for Mathematical Sciences, N)
By Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, Yue Yang




  • Publisher: World Scientific Publishing Company
  • Number Of Pages: 432
  • Publication Date: 2008-06-02
  • ISBN-10 / ASIN: 9812796541
  • ISBN-13 / EAN: 9789812796547
  • Binding: Hardcover




Product Description:

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: Prompt Simplicity, Array Computability and Cupping (R Downey et al.); A Simpler Short Extenders Forcing Gap 3 (M Gitik); The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (D R Hirschfeldt et al.); Absoluteness for Universally Baire Sets and the Uncountable II (I Farah et al.); Modaic Definability of Ordinals (I Neeman); Eliminating Concepts (A Nies); Rigidity and Biinterpretability in the Hyperdegrees (R A Shore); Some Fundamentals Issues Concerning Degrees or Unsolvability (S G Simpson); A tt Version of the Posner Robinson Theorem (W H Woodin); and other papers

 
عودة
أعلى