Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T15:50:14.547Z Has data issue: false hasContentIssue false

Separating Points and Coloring Principles

Published online by Cambridge University Press:  20 November 2018

W. Stephen Watson*
Affiliation:
York University, DownsView, Ontario. M3J1P3, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1984