加载中…
We show that unlike , is consistent with the existence of -many Countryman lines which pairwise contain no uncountable isomorphic or reverse-isomorphic suborders. This clarifies an issue regarding the claim that implies that there is a finite basis for the Countryman lines. The family of Countryman lines comes from a family of -many coherent trees which pairwise contain no club-isomorphic subtrees. To prove this, we first construct such a family of trees using , and then we iterate ccc forcings while preserving this property.

生成讲解博客的中文版本

生成AI智能校验的中文版本