2019
DOI: 10.1215/00294527-2019-0011
|View full text |Cite
|
Sign up to set email alerts
|

More Notions of Forcing Add a Souslin Tree

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 21 publications
0
8
0
Order By: Relevance
“…Proof. By the main result of [BR19b], in V P , an instance of the proxy principle, much stronger than P − µ (κ, 2, µ ⊑, κ, {E κ µ }, 2, 1 1 2 ), holds. So, by Lemma 7.12, if V P |= µ <µ = µ, then V P |= Pℓ 1 (µ + , µ + , µ).…”
Section: Strongest Instancementioning
confidence: 95%
“…Proof. By the main result of [BR19b], in V P , an instance of the proxy principle, much stronger than P − µ (κ, 2, µ ⊑, κ, {E κ µ }, 2, 1 1 2 ), holds. So, by Lemma 7.12, if V P |= µ <µ = µ, then V P |= Pℓ 1 (µ + , µ + , µ).…”
Section: Strongest Instancementioning
confidence: 95%
“…Fix a sequence trueC=Cα0.33em|α<κ$\vec{C}=\langle C_\alpha \ \lvert \ \alpha &lt;\kappa \rangle$ witnessing P(κ,2,,1,false{Sfalse})$\operatorname{P}^-(\kappa,2,{\sqsubseteq ^*},1,\lbrace S\rbrace)$, and fix a well‐ordering $\vartriangleleft$ of Hκ$H_\kappa$. Following the proof of [2, Proposition 2.2], we shall recursively construct a sequence false⟨Tα0.33em|α<κ$\langle T_\alpha \ \lvert \ \alpha &lt;\kappa \rangle$ such that T:=α<κTα$T:=\bigcup _{\alpha &lt;\kappa }T_\alpha$ will constitute a normal prolific full streamlined κ$\kappa$‐Souslin tree whose αth$\alpha {\text{th}}$ level is Tα$T_\alpha$. Let T0:={}$T_0:=\lbrace \emptyset \rbrace$, and for all α<κ$\alpha &lt;\kappa$ let Tα+1:={ti0.33em|t∈<...…”
Section: Full Souslin Trees At Strongly Inaccessiblesmentioning
confidence: 99%
“…Proof. We settle for proving Clause(2). So, suppose that ⟨𝑋 𝛽 | 𝛽 ∈ 𝐸 𝜆 𝜃 ⟩ witnesses ♣(𝐸 𝜆 𝜃 ), for a given 𝜃 ∈ Reg(𝜆), and we shall prove that ♢ * 𝑆,𝐵 (𝜅-trees) holds for 𝐵 ∶= 𝐸 𝜅 𝜃 .…”
mentioning
confidence: 98%
“…As mentioned earlier, even in the presence of GCH, (κ, <κ) does not imply the existence of a κ-Souslin tree. For this, Brodsky and the author have introduced the following slight strengthening of (κ, <κ): (Brodsky & Rinot;[4]) * (κ) asserts the existence of a sequence C α | α < κ such that 1. for every limit ordinal α < κ, (a) C α is a nonempty collection of club subsets of α, with |C α | < κ; and (b) for every C ∈ C α and everyᾱ ∈ acc(C), we have C ∩ᾱ ∈ Cᾱ; 2. for every cofinal X ⊆ κ, there is α ∈ acc(κ) such that sup(nacc(C) ∩ X ) = α for all C ∈ C α .…”
Section: For Every Limit Ordinal α < κmentioning
confidence: 99%