Displaying similar documents to “A non-metrizable collectionwise Hausdorff tree with no uncountable chains and no Aronszajn subtrees”

Pressing Down Lemma for λ -trees and its applications

Hui Li, Liang-Xue Peng (2013)

Czechoslovak Mathematical Journal

Similarity:

For any ordinal λ of uncountable cofinality, a λ -tree is a tree T of height λ such that | T α | < cf ( λ ) for each α < λ , where T α = { x ∈ T : ht ( x ) = α } . In this note we get a Pressing Down Lemma for λ -trees and discuss some of its applications. We show that if η is an uncountable ordinal and T is a Hausdorff tree of height η such that | T α | ≤ ω for each α < η , then the tree T is collectionwise Hausdorff if and only if for each antichain C ⊂ T and for each limit ordinal α ≤ η with cf ( α ) > ω , { ht ( c ) : c ∈ C } ∩ α is not stationary in α . In the last part of this note, we investigate...

Rudin's Dowker space in the extension with a Suslin tree

Teruyuki Yorioka (2008)

Fundamenta Mathematicae

Similarity:

We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle refining property for forcing notions, which modifies the one for partitions due to Paul B. Larson and Stevo Todorčević and is stronger than the countable chain condition. It is proved that Martin's Axiom for forcing notions with the rectangle refining property implies that every generalized Rudin space constructed from Aronszajn trees is non-Dowker, and that the same...