2016
DOI: 10.1016/j.topol.2015.12.088
|View full text |Cite
|
Sign up to set email alerts
|

Selective but not Ramsey

Abstract: We give a partial answer to the following question of Dobrinen: For a given topological Ramsey space R, are the notions of selective for R and Ramsey for R equivalent? Every topological Ramsey space R has an associated notion of Ramsey ultrafilter for R and selective ultrafilter for R (see [1]). If R is taken to be the Ellentuck space then the two concepts reduce to the familiar notions of Ramsey and selective ultrafilters on ω; so by a wellknown result of Kunen the two are equivalent. We give the first exampl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 15 publications
0
14
0
Order By: Relevance
“…In this section, we shall describe the main properties of the forcing notion (H, ≤ * ), for a semiselective H. To do so, we shall need to consider a special type of coideal U ⊆ R: Definition 6.1 Given U ⊆ R, we say that U is an ultrafilter if it satisfies the following: In [29], a similar abstract definition of ultrafilter is used. But the ultrafilters used in [29] do not satisfy part (c) of Definition 6.1.…”
Section: The Souslin Operationmentioning
confidence: 99%
“…In this section, we shall describe the main properties of the forcing notion (H, ≤ * ), for a semiselective H. To do so, we shall need to consider a special type of coideal U ⊆ R: Definition 6.1 Given U ⊆ R, we say that U is an ultrafilter if it satisfies the following: In [29], a similar abstract definition of ultrafilter is used. But the ultrafilters used in [29] do not satisfy part (c) of Definition 6.1.…”
Section: The Souslin Operationmentioning
confidence: 99%
“…However it is still unknown if, under sans-serifCH, there are selective for Rα ultrafilters on [Tα] which are not Ramsey for Rα for ωα<ω1. The methods used in fail for infinite α as the trees Tα have infinite height. Question Assume that 1<α<ω1.…”
Section: Resultsmentioning
confidence: 99%
“…Let w ′ denote π r j (v) (v(j)). Then w ′ is the ≺-least member of ϕ ′′ (v) satisfying w ≺ w ′ , so by observation (16), we see that {π r l (v) (v(l)) ≺ w : l < |v|} = ϕ ′′ (r j (v)). Therefore, ϕ ′′ (r i (u)) = ϕ ′′ (r j (v)), since w is the ≺-least member of ϕ ′′ (u)△ϕ ′′ (v).…”
Section: Proofmentioning
confidence: 96%
“…Next, we show that ϕ holds the same information about R that ϕ ′′ does. The following observation will be useful: For each u ∈F|W , (16) π r 0 (u) (u(0)) u(0) ≺ π r 1 (u) (u(1)) u(1) ≺ · · · .…”
Section: Proofmentioning
confidence: 99%
See 1 more Smart Citation