2004
DOI: 10.1017/cbo9780511546457
|View full text |Cite
|
Sign up to set email alerts
|

The Covering Property Axiom, CPA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0

Year Published

2004
2004
2020
2020

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 37 publications
(38 citation statements)
references
References 90 publications
0
38
0
Order By: Relevance
“…Also recall that it is consistent that cof(N ω ) = ω 1 < c; this is so in the Sacks model, see e.g. [5]. Theorem 3.3 Assuming cof(N ω ) = ω 1 there is a Boolean algebra B of cardinality ω 1 such that B has a strictly positive measure but carries no strictly positive separable measure.…”
Section: 1mentioning
confidence: 91%
“…Also recall that it is consistent that cof(N ω ) = ω 1 < c; this is so in the Sacks model, see e.g. [5]. Theorem 3.3 Assuming cof(N ω ) = ω 1 there is a Boolean algebra B of cardinality ω 1 such that B has a strictly positive measure but carries no strictly positive separable measure.…”
Section: 1mentioning
confidence: 91%
“…Under the CPA, Covering Property Axiom (see [32] for details), we have that SZ \.D [ S/ D ¿ (hence SZ \ ES D ¿).…”
Section: Sierpiński-zygmund Functionsmentioning
confidence: 99%
“…The cardinality of R is denoted by c. By ZFC we mean Zermelo-Fraenkel set theory with the axiom of choice, by CPA we mean the Covering Property Axiom, see e.g. [7], and by CH we mean the Continuum Hypothesis. In this paper we always consider R as a linear space over Q, except in subsection 3.3 where it is explicitly indicated otherwise.…”
Section: Preliminariesmentioning
confidence: 99%