


default search action
DIMACS Workshop: Set Theory: The Hajnal Conference, 1999
- Simon Thomas:

Set Theory: The Hajnal Conference, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 15-17, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 58, DIMACS/AMS 1999, ISBN 978-0-8218-2786-4 - Foreword. Set Theory: The Hajnal Conference 1999: ix-

- Preface. Set Theory: The Hajnal Conference 1999: xi-

- Scott Adams:

Containment does not imply Borel reducibility. 1-23 - James E. Baumgartner:

Hajnal's contributions to combinatorial set theory and the partition calculus. 25-30 - Carl Darby, Jean A. Larson:

Multicolored graphs on countable ordinals of finite exponent. 31-43 - Mirna Dzamonja:

On D-spaces and discrete families of sets. 45-63 - Ilijas Farah:

Analytic Hausdorff gaps. 65-72 - Matthew D. Foreman:

Stationary sets, Chang's conjecture and partition theory. 73-94 - István Juhász, Lajos Soukup, Zoltán Szentmiklóssy:

A consistent example of a hereditarily c-Lindelof first countable space of size > c. 95-98 - Péter Komjáth:

Subgraph chromatic number. 99-106 - Saharon Shelah

:
Superatomic Boolean algebras: Maximal rigidity. 107-128 - Simon Thomas:

Some applications of superrigidity to Borel equivalence relations. 129-134 - Stevo Todorcevic:

Localized reflection and fragments of PFA. 135-148 - Boban Velickovic:

The basis problem for CCC posets. 149-160

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














