2017
DOI: 10.1017/fms.2016.34
|View full text |Cite
|
Sign up to set email alerts
|

Reduced Powers of Souslin Trees

Abstract: We study the relationship between a κ-Souslin tree T and its reduced powers T θ / . Previous works addressed this problem from the viewpoint of a single power θ , whereas here, tools are developed for controlling different powers simultaneously. As a sample corollary, we obtain the consistency of an ℵ 6 -Souslin tree T and a sequence of uniform ultrafilters n | n < 6 such that T ℵn / n is ℵ 6 -Aronszajn if and only if n < 6 is not a prime number. This paper is the first application of the microscopic approach … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
24
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(25 citation statements)
references
References 22 publications
1
24
0
Order By: Relevance
“…are defined analogously. (2) We let T C i denote the tree with underlying set S C ≤i and Then c γ is injective on < T -chains in r −1 "{γ}. If α ∈ dom(c γ ) \ A is not minimal in T, then we have acc(C α,i ) = ∅, acc(C α,i ) ∩ ht T (α) = ∅ and therefore ht T (α) ≤ min(acc(C α,i )) = r(α) = γ.…”
Section: Chain Conditionsmentioning
confidence: 99%
“…are defined analogously. (2) We let T C i denote the tree with underlying set S C ≤i and Then c γ is injective on < T -chains in r −1 "{γ}. If α ∈ dom(c γ ) \ A is not minimal in T, then we have acc(C α,i ) = ∅, acc(C α,i ) ∩ ht T (α) = ∅ and therefore ht T (α) ≤ min(acc(C α,i )) = r(α) = γ.…”
Section: Chain Conditionsmentioning
confidence: 99%
“…But this relation is also useful in the absence of E λ . For instance, in [BR15], a λ-complete λ-free λ + -Souslin tree was constructed assuming λ <λ = λ and P(λ…”
Section: The Coherence Relation λ ⊑mentioning
confidence: 99%
“…The outcome will always be a tree, but its features depend on which actions where invoked along the way, and to which vector of parameters of the proxy principle the witness was given. Once the construction of Souslin trees becomes so simple, it is then easier to carry out considerably more complex constructions, and this has already been demonstrated in [BR15], where we gave the first example of a Souslin tree whose reduced powers behave independently of each other, proving, e.g., that V = L entails an ℵ 7 -Souslin tree whose reduced ℵ n -power is ℵ 7 -Aronszajn iff n ∈ {0, 1, 4, 5}.…”
mentioning
confidence: 99%
See 2 more Smart Citations