2013
DOI: 10.1090/s0002-9939-2013-11518-2
|View full text |Cite
|
Sign up to set email alerts
|

On strong $P$-points

Abstract: This paper investigates the combinatorial property of ultrafilters where the Mathias forcing relativized to them does not add dominating reals. We prove that the characterization due to Hrušák and Minami is equivalent to the strong P -point property. We also consistently construct a P -point that has no rapid Rudin-Keisler predecessor but that is not a strong P -point. These results answer questions of Canjar and Laflamme.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(14 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…Laflamme noted without a proof that Canjar ultrafilters were strong P + -filters and asked if these two notions were equivalent. This was answered positively by Blass, Hrušák and Verner in [3]. We will now extend their result to the general case.…”
Section: Definitionmentioning
confidence: 68%
See 2 more Smart Citations
“…Laflamme noted without a proof that Canjar ultrafilters were strong P + -filters and asked if these two notions were equivalent. This was answered positively by Blass, Hrušák and Verner in [3]. We will now extend their result to the general case.…”
Section: Definitionmentioning
confidence: 68%
“…We say that an ideal I is a Canjar ideal if its dual filter I * = {ω − X | X ∈ I } is a Canjar filter. Canjar filters have been investigated in [7] and [3], this paper is a continuation of that line of research.…”
Section: Introductionmentioning
confidence: 93%
See 1 more Smart Citation
“…In [18] it was proved that a filter is Canjar if and only if is has the Menger property (as a subspace of ℘ (ω)). Canjar filters have been further studied in [5], [28], [27], [23] and [30].…”
Section: There Ismentioning
confidence: 99%
“…The Miller forcing PT consists of all Miller trees ordered by inclusion. 5 Miller forcing (also called "super perfect forcing") was introduced by Miller in [49], this is one of the most useful and studied forcings for adding new reals (see [2], [49] or [29]). By split (p) we denote the collection of all splitting nodes and by split n (p) we denote the collection of n-splitting nodes (i.e.…”
Section: Miller Forcing Based On Filtersmentioning
confidence: 99%