On $D$-spaces and Discrete Families of Sets
| dc.creator | Džamonja, Mirna | |
| dc.date | 2006-08-25 | |
| dc.date.accessioned | 2026-07-07T07:22:10Z | |
| dc.date.available | 2026-07-07T07:22:10Z | |
| dc.description | We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The upwards reflection theorems are obtained in the presence of a forcing axiom, while most of the downwards reflection results use large cardinal assumptions. The combinatorial content of arguments showing that a given space is a $D$-space, can be formulated using the concept of discrete families. We note the connection between non-reflection arguments involving discrete families and the well known question of the existence of families allowing partial transversals without having a transversal themselves, and use it to give non-trivial instances of the incompactness phenomenon in the context of discretisations. | |
| dc.identifier | https://arxiv.org/abs/math/0608636 | |
| dc.identifier | http://arxiv.org/abs/math/0608636 | |
| dc.identifier | in AMS, DIMACS: Series in Discrete Mathematics and Theoretical Computer Sciences, ed. by S. Thomas 58 (2002), 45-63 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115562 | |
| dc.subject | Logic | |
| dc.subject | 03E35, 54E20, 03E55 | |
| dc.title | On $D$-spaces and Discrete Families of Sets | |
| dc.type | text |