AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Set Theory: The Hajnal Conference
About this Title
Simon Thomas, Rutgers University, New Brunswick, NJ, Editor
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
2002; Volume 58
ISBNs: 978-0-8218-2786-4 (print); 978-1-4704-4016-9 (online)
DOI: https://doi.org/10.1090/dimacs/058
MathSciNet review: MR1903845
MSC: Primary 03-06; Secondary 00B30, 03Exx
ReadershipTable of Contents
Front/Back Matter
Chapters
- Containment does not imply Borel reducibility
- Hajnal’s contributions to combinatorial set theory and the partition calculus
- Multicolored graphs on countable ordinals of finite exponent
- On $D$-spaces and discrete families of sets
- Analytic Hausdorff gaps
- Stationary sets, Chang’s conjecture and partition theory
- A consistent example of a hereditarily $\mathfrak {c}$-Lindelöf first countable space of size $>\mathfrak {c}$
- Subgraph chromatic number
- Superatomic Boolean algebras: Maximal rigidity
- Some applications of superrigidity to Borel equivalence relations
- Localized reflection and fragments of PFA
- The basis problem for CCC posets