Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Computational Prospects of Infinity II: Presented Talks (Lecture Notes Series, Institute for Mathematical Sciences, N)

Computational Prospects of Infinity II: Presented Talks (Lecture Notes Series, Institute for Mathematical Sciences, N)


Book Informaton

Computational Prospects of Infinity II: Presented Talks (Lecture Notes Series, Institute for Mathematical Sciences, N)

Author

Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, Yue Yang

Year of Publication

2008

Publisher

World Scientific

City of Publication

Hackensack, N.J

Language

en

ISBN

9812796541, 9789812796547, 9812796533, 9789812796530

ARI Id

1672348411145


Find on

World Cat

OpenLibrary

Internet Archive


This page has been accessed 3 times.
Asian Research Index Whatsapp Chanel
Asian Research Index Whatsapp Chanel

Join our Whatsapp Channel to get regular updates.

Citation Options
Download Citation

Showing 1 to 20 of 109 entries
Chapters/HeadingsAuthor(s)PagesInfo
1 Introduction
2 The technical theorem and some intuition for its proof
222 Measuring whether the equations hold: σ1(X, Y, Λa, x, Λa, y, Λxy, a)
224 Making C the infimum of CD and CE: s3(X, Y, a, x, a, y, xy, a, cd, ce)
226 If Θby(BY ) = A then y, a(Y ) = A: σ6(X, Y, Λa, x, Λa, y, Λxy, a, Θby)
227 One sequence (X, Y, Λa, x, Λa, y, Λxy, a)
32 The tree of strategies
321 η-congurations
332 Adding a σ1(X, Y, Λa, x, Λa, y, Λxy, a)
333 Adding a σ2(X, Y, Λa, x, Λa, y, Λxy, a)
336 Adding a σ6(X, Y, Λa, x, Λa, y, Λxy, a, Θby)
34 Analyzing the construction
1 Main starting questions and some pieces of notation
2 Results not mentioning forcing axioms
3 Results mentioning strong forcing axioms
4 Open questions and some consequences of large cardinal axioms
2 BE 02 models
Prompt Simplicity, Array Computability and Cupping Rod Downey, Noam Greenberg, Joseph S Miller and Rebecca Weber
2 PS AC cuppable
21 Construction
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 109 entries