Computational Prospects of Infinity - Part II: Presented Talks

Sommario

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.

Dettagli sul prodotto

• Autori: Chong Chitat
• Con la collaborazione di: Chitat Chong (Editore), Qi Feng (Editore), Theodore A. Slaman (Editore), W. Hugh Woodin (Editore)
• Editore: World Scientific
• Lingue: Inglese
• Formato: Copertina rigida
• Pubblicazione: 01.01.2008
• Pagine: 432
• Dimensioni: 157 mm x 231 mm x 28 mm
• Peso: 748 g
• Serie: Lecture Notes Series, Institut
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Fondamenti