For uncountable downwards closed subtrees and of an -tree , we say that and are strongly almost disjoint if their intersection is a finite union of countable chains. The tree is strongly non-saturated if there exists a strongly almost disjoint family of -many uncountable downwards closed subtrees of . In this article we construct a Knaster forcing which adds a Suslin tree together with a family of -many strongly almost disjoint automorphisms of it (and thus the square of the Suslin tree is strongly non-saturated). To achieve this goal, we introduce a new idea called -separation, which is an adaptation to the finite context of the notion of separation which was recently introduced by Stejskalová and the first author for the purpose of adding automorphisms of a tree with a forcing with countable conditions.

生成讲解博客的中文版本

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