2022
DOI: 10.4064/fm109-9-2021
|View full text |Cite
|
Sign up to set email alerts
|

Towers and gaps at uncountable cardinals

Abstract: Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either p(κ) = t(κ) or there is a (p(κ), λ)-gap of club-supported slaloms for some λ < p(κ). While the existence of such gaps is unclear, this is a promising step to lift Malliaris and Shelah's proof of p = t to uncountable cardinals. We do analyze gaps of slaloms and, in particular, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…A proof of pcl(κ)=frakturb(κ)$\mathfrak {p}_{cl}(\kappa ) = \mathfrak {b}(\kappa )$ for a regular uncountable κ is given in [6, Observation 4.2]. A consistency proof of frakturp(κ)=κ+<frakturb(κ)$\mathfrak {p}(\kappa ) = \kappa ^+ &lt; \mathfrak {b}(\kappa )$, which uses the identity pcl(κ)=frakturb(κ)$\mathfrak {p}_{cl}(\kappa ) = \mathfrak {b}(\kappa )$, is given in [6, § 4]. The relevant poset for this proof and for our proof in § 4 is the following: Definition Let C$\mathcal {C}$ denote the collection of all clubs in κ.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…A proof of pcl(κ)=frakturb(κ)$\mathfrak {p}_{cl}(\kappa ) = \mathfrak {b}(\kappa )$ for a regular uncountable κ is given in [6, Observation 4.2]. A consistency proof of frakturp(κ)=κ+<frakturb(κ)$\mathfrak {p}(\kappa ) = \kappa ^+ &lt; \mathfrak {b}(\kappa )$, which uses the identity pcl(κ)=frakturb(κ)$\mathfrak {p}_{cl}(\kappa ) = \mathfrak {b}(\kappa )$, is given in [6, § 4]. The relevant poset for this proof and for our proof in § 4 is the following: Definition Let C$\mathcal {C}$ denote the collection of all clubs in κ.…”
Section: Preliminariesmentioning
confidence: 99%
“…So the poset that we are forcing with is double-struckP=Cκ+trueṀfalse(scriptCfalse)λ$\mathbb {P} = \mathbb {C}_{\kappa ^+}* \dot{\mathbb {M}}(\mathcal {C})_\lambda$, where trueṀfalse(scriptCfalse)λ$\dot{\mathbb {M}}(\mathcal {C})_\lambda$ is a double-struckCκ+$\mathbb {C}_{\kappa ^+}$‐name for the <κ$&lt;\kappa$‐support iteration of double-struckMfalse(scriptCfalse)$\mathbb {M}(\mathcal {C})$ (from Definition 2.6) of length λ. The following property and notation have been established in [6]: 1.This forcing P$\mathbb {P}$ has the κ+$\kappa ^+$‐c.c., is κ‐closed and forces that frakturcfalse(κfalse)=λ$\mathfrak {c}(\kappa ) = \lambda$. …”
Section: Confalse(frakturs(κ)=κ+mentioning
confidence: 99%
“…The significance of this definition is that the forcing axiom for the class of <κclosed, κ-centered posets with canonical lower bounds is equivalent to p(κ) = 2 κ . More precisely, Theorem 3.3 [Theorem 1.8 of [3]] If P is a <κ-closed, κ-centered poset with canonical lower bounds and below every p ∈ P there is a κ-sized antichain. Then for any collection D of <p(κ) many dense subsets of P, there is a filter G ⊆ P which meets every element of D.…”
Section: Controlling the Number Of Orbits Of A ä-Maximal Cofinitary G...mentioning
confidence: 99%
“…It suffices to ensure that for each U γ and each word w ∈ W α the permutation w(h) U γ : U γ → U γ has <κ many fixed points. 3 We will construct h U γ differently depending on f α .…”
Section: Lemma 313 Let C ∈ [κ] κ and F : C → C Be A Partial Injection...mentioning
confidence: 99%
See 1 more Smart Citation