Computational Prospects of Infinity
C. T. Chong, Qi Feng, Theodore A Slaman, W Hugh Woodin, Yue Yang · Lecture notes series, Institute For Mathematical Sciences · 2008
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) Diamonds on P (M Shioya) Rigidity and Biinterpretability in the Hyperdegrees (R A Shore) Some Fundamentals Issues Concerning Degrees or Unsolvability (S G Simpson) A tt Version of the Poner-Robinson Theorem (W H Woodin) and other papers.