Reduced powers of -trees
Keith Devlin (1983)
Fundamenta Mathematicae
Similarity:
Keith Devlin (1983)
Fundamenta Mathematicae
Similarity:
Keith Devlin (1983)
Fundamenta Mathematicae
Similarity:
Jaroslav Nešetřil (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Keith Devlin (1972)
Fundamenta Mathematicae
Similarity:
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...
Saharon Shelah, R. Jin (1992)
Fundamenta Mathematicae
Similarity:
By an - tree we mean a tree of power and height . Under CH and we call an -tree a Jech-Kunen tree if it has κ-many branches for some κ strictly between and . In this paper we prove that, assuming the existence of one inaccessible cardinal, (1) it is consistent with CH plus that there exist Kurepa trees and there are no Jech-Kunen trees, which answers a question of [Ji2], (2) it is consistent with CH plus that there only exist Kurepa trees with -many branches, which answers...
Hui Li, Liang-Xue Peng (2013)
Czechoslovak Mathematical Journal
Similarity:
For any ordinal of uncountable cofinality, a -tree is a tree of height such that for each , where . 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 is a Hausdorff tree of height such that for each , then the tree is collectionwise Hausdorff if and only if for each antichain and for each limit ordinal with , is not stationary in . In the last part of this note, we investigate...