Descriptive set theory and forcing; How to prove theorems about Borel sets the hard way

Abstract

These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies and MA. Section 14 and 15 contain new results concerning the lengths of Borel hierarchies in the Cohen and random real model. Part 2 contains standard results on the theory of Analytic sets. Section 25 contains Harrington's Theorem that it is consistent to have ${\Pi }_2^1$ sets of arbitrary cardinality. Part 3 has the usual separation theorems. Part 4 gives some applications of Gandy forcing. We reverse the usual trend and use forcing arguments instead of Baire category. In particular, Louveau's Theorem on ${\Pi }_{\alpha }^0$ hyp-sets has a simpler proof using forcing.

Cited by in corpus (6)

• On a Glimm -- Effros dichotomy and an Ulm--type classification in Solovay model
• Convergence of Quotients of AF Algebras in Quantum Propinquity by Convergence of Ideals
• AF algebras in the quantum Gromov-Hausdorff propinquity space
• On a dichotomy related to colourings of definable graphs in generic models
• Bunce-Deddens algebras as quantum Gromov-Hausorff distance limits of circle algebras
• Quantum metrics on the tensor product of a commutative C*-algebra and an AF C*-algebra