Muutke küpsiste eelistusi

Descriptive Set Theory Second Edition [Kõva köide]

  • Formaat: Hardback, 502 pages, kaal: 1078 g, Illustrations
  • Sari: Mathematical Surveys and Monographs
  • Ilmumisaeg: 30-Jul-2009
  • Kirjastus: American Mathematical Society
  • ISBN-10: 0821848135
  • ISBN-13: 9780821848135
Teised raamatud teemal:
  • Formaat: Hardback, 502 pages, kaal: 1078 g, Illustrations
  • Sari: Mathematical Surveys and Monographs
  • Ilmumisaeg: 30-Jul-2009
  • Kirjastus: American Mathematical Society
  • ISBN-10: 0821848135
  • ISBN-13: 9780821848135
Teised raamatud teemal:
Descriptive Set Theory is the study of sets in separable, complete metric spaces that can be defined (or constructed), and so can be expected to have special properties not enjoyed by arbitrary pointsets. This subject was started by the French analysts at the turn of the 20th century, most prominently Lebesgue, and, initially, was concerned primarily with establishing regularity properties of Borel and Lebesgue measurable functions, and analytic, coanalytic, and projective sets. Its rapid development came to a halt in the late 1930s, primarily because it bumped against problems which were independent of classical axiomatic set theory. The field became very active again in the 1960s, with the introduction of strong set-theoretic hypotheses and methods from logic (especially recursion theory), which revolutionized it. This monograph develops Descriptive Set Theory systematically, from its classical roots to the modern 'effective' theory and the consequences of strong (especially determinacy) hypotheses. The book emphasizes the foundations of the subject, and it sets the stage for the dramatic results (established since the 1980s) relating large cardinals and determinacy or allowing applications of Descriptive Set Theory to classical mathematics. The book includes all the necessary background from (advanced) set theory, logic and recursion theory.
Preface to the Second Edition ix
Preface to the First Edition xi
About this Book xiii
Introduction 1(8)
The Basic Classical Notions
9(40)
Perfect Polish spaces
9(4)
The Borel pointclasses of finite order
13(5)
Computing with relations; closure properties
18(8)
Parametrization and hierarchy theorems
26(3)
The projective sets
29(4)
Countable operations
33(4)
Borel functions and isomorphisms
37(9)
Historical and other remarks
46(3)
κ-Suslin and λ-Borel
49(38)
The Cantor-Bendixson Theorem
50(1)
κ-Suslin sets
51(6)
Trees and the Perfect Set Theorem
57(5)
Wellfounded trees
62(3)
The Suslin Theorem
65(5)
Inductive analysis of projections of trees
70(4)
The Kunen-Martin Theorem
74(5)
Category and measure
79(6)
Historical remarks
85(2)
Basic Notions of the Effective Theory
87(58)
Recursive functions on the integers
89(7)
Recursive presentations
96(5)
Semirecursive pointsets
101(9)
Recursive and Γ-recursive functions
110(8)
The Kleene pointclasses
118(7)
Universal sets for the Kleene pointclasses
125(5)
Partial functions and the substitution property
130(5)
Codings, uniformity and good parametrizations
135(6)
Effective theory on arbitrary (perfect) Polish spaces
141(1)
Historical remarks
142(3)
Structure Theory for Pointclasses
145(62)
The basic representation theorem for Π11 sets
145(7)
The prewellordering property
152(6)
Spector pointclasses
158(7)
The parametrization theorem for Δ X
165(8)
The uniformization theorem for Π11, Σ12
173(11)
Additional results about Π11
184(18)
Historical remarks
202(5)
The Constructible Universe
207(10)
Descriptive set theory in L
208(6)
Independence results obtained by the method of forcing
214(1)
Historical remarks
215(2)
The Playful Universe
217(76)
Infinite games of perfect information
218(11)
The First Periodicity Theorem
229(6)
The Second Periodicity Theorem; uniformization
235(9)
The game quantifier
244(10)
The Third Periodicity Theorem
254(18)
The determinacy of Borel sets
272(8)
Measurable cardinals
280(10)
Historical remarks
290(3)
The Recursion Theorem
293(60)
Recursion in a Σ-pointclass
293(5)
The Suslin-Kleene Theorem
298(11)
Inductive definability
309(14)
The completely playful universe
323(16)
Historical remarks
339(2)
Results which depend on the Axiom of Choice
341(12)
Metamathematics
353(122)
Structures and languages
355(10)
Elementary definability
365(6)
Definability in the universe of sets
371(10)
Godel's universe of constructible sets
381(9)
Absoluteness
390(11)
The basic facts about L
401(15)
Regularity results and inner models
416(30)
On the theory of indiscernibles
446(22)
Some remarks about strong hypotheses
468(5)
Historical remarks
473(2)
The Axiomatics of Pointclasses 475(2)
References 477(14)
Index 491