Muutke küpsiste eelistusi

Forcing Idealized [Kõva köide]

(University of Florida)
  • Formaat: Hardback, 320 pages, kõrgus x laius x paksus: 234x160x21 mm, kaal: 638 g, Worked examples or Exercises; 3 Line drawings, unspecified
  • Sari: Cambridge Tracts in Mathematics
  • Ilmumisaeg: 07-Feb-2008
  • Kirjastus: Cambridge University Press
  • ISBN-10: 0521874262
  • ISBN-13: 9780521874267
Teised raamatud teemal:
  • Formaat: Hardback, 320 pages, kõrgus x laius x paksus: 234x160x21 mm, kaal: 638 g, Worked examples or Exercises; 3 Line drawings, unspecified
  • Sari: Cambridge Tracts in Mathematics
  • Ilmumisaeg: 07-Feb-2008
  • Kirjastus: Cambridge University Press
  • ISBN-10: 0521874262
  • ISBN-13: 9780521874267
Teised raamatud teemal:
Descriptive set theory and definable proper forcing are two areas of set theory that developed quite independently of each other. This monograph unites them and explores the connections between them. Forcing is presented in terms of quotient algebras of various natural sigma-ideals on Polish spaces, and forcing properties in terms of Fubini-style properties or in terms of determined infinite games on Boolean algebras. Many examples of forcing notions appear, some newly isolated from measure theory, dynamical systems, and other fields. The descriptive set theoretic analysis of operations on forcings opens the door to applications of the theory: absoluteness theorems for certain classical forcing extensions, duality theorems, and preservation theorems for the countable support iteration. Containing original research, this text highlights the connections that forcing makes with other areas of mathematics, and is essential reading for academic researchers and graduate students in set theory, abstract analysis and measure theory.

Muu info

Monograph exploring the connections that forcing makes with descriptive set theory and other areas of mathematics.
1 Introduction 1
1.1 Welcome
1
1.2 Navigation
2
1.3 Notation
5
1.4 Background
6
2 Basics 15
2.1 Forcing with ideals
15
2.2 Properness
25
2.3 Topological representation of names
29
3 Properties 33
3.1 Continuous reading of names
33
3.2 Fubini properties of ideals
37
3.3 Bounding forcings
42
3.4 Bounding and not adding splitting real
46
3.5 Preservation of Baire category
52
3.6 Preservation of outer Lebesgue measure
58
3.7 The countable chain condition
64
3.8 Π11 and Σ11 on ideals
70
3.9 Dichotomies
78
3.10 Games on Boolean algebras
87
3.11 Ramsey properties
106
3.12 Pure decision property
111
4 Examples 113
4.1 Ideals σ-generated by closed sets
113
4.2 Porosity ideals
131
4.3 Capacities
143
4.4 Hausdorff measures and variations
179
4.5 Pavement submeasures
194
4.6 Analytic P-ideal forcings
209
4.7 Other examples
213
5 Operations 225
5.1 The countable support iteration 225.
5.2 Side-by-side product
239
5.3 Unions of σ-ideals
247
5.4 Illfounded iteration
252
5.5 Directed systems of ideals
264
6 Applications 269
6.1 Cardinal invariant inequalities
269
6.2 Duality theorems
278
6.3 Preservation theorems
285
7 Questions 303
7.1 Basics
303
7.2 Properties
303
7.3 Examples
304
7.4 Operations
306
7.5 Applications
306
Bibliography 307
Index 313