Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 83 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

An almost Kurepa Suslin tree with strongly non-saturated square (2406.10463v2)

Published 15 Jun 2024 in math.LO

Abstract: For uncountable downwards closed subtrees $U$ and $W$ of an $\omega_1$-tree $T$, we say that $U$ and $W$ are strongly almost disjoint if their intersection is a finite union of countable chains. The tree $T$ is strongly non-saturated if there exists a strongly almost disjoint family of $\omega_2$-many uncountable downwards closed subtrees of $T$. In this article we construct a Knaster forcing which adds a Suslin tree together with a family of $\omega_2$-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 $\rho$-separation, which is an adaptation to the finite context of the notion of separation which was recently introduced by Stejskalov\'{a} and the first author for the purpose of adding automorphisms of a tree with a forcing with countable conditions.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.