Separating Points and Coloring Principles
Canadian mathematical bulletin, Tome 27 (1984) no. 4, pp. 398-404
Voir la notice de l'article provenant de la source Cambridge
In the mid 1970's, Shelah formulated a weak version of ◊. This axiom Φ is a prediction principle for colorings of the binary tree of height ω1. Shelah and Devlin showed that Φ is equivalent to 2א0 < 2א1 .In this paper, we formulate Φp, a "Φ for partial colorings", show that both ◊* and Fleissner's “◊ for stationary systems” imply Φp, that ◊ does not imply Φp and that Φp does not imply CH.We show that Φp implies that, in a normal first countable space, a discrete family of points of cardinality א1 is separated.
Watson, W. Stephen. Separating Points and Coloring Principles. Canadian mathematical bulletin, Tome 27 (1984) no. 4, pp. 398-404. doi: 10.4153/CMB-1984-061-3
@article{10_4153_CMB_1984_061_3,
author = {Watson, W. Stephen},
title = {Separating {Points} and {Coloring} {Principles}},
journal = {Canadian mathematical bulletin},
pages = {398--404},
year = {1984},
volume = {27},
number = {4},
doi = {10.4153/CMB-1984-061-3},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1984-061-3/}
}
Cité par Sources :