mu-complete Suslin trees on mu^+
Menachem Kojman, Saharon Shelah
我们证明了mu = mu^{< mu}，2 ^mu = mu^+和"存在一个由共尾性<mu的序数组成的mu^+的非反射平稳子集“暗示着在mu^+上存在一棵mu-完全Souslin树。
We prove that mu = mu^{< mu}, 2^mu = mu^+ and ``there is a non reflecting stationary subset of mu^+ composed of ordinals of cofinality < mu'' imply that there is a mu-complete Souslin tree on mu^+ .
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We prove that club does not imply the existence of a Suslin tree, so answering a question of I. Juhasz.
We introduce the idea of a weakly entangled linear order, and show that it is consistent for a Suslin line to be weakly entangled. We generalize the notion of entangled linear orders to $ω_1$-trees, and prove that an $ω_1$-tree is entangled iff it is free. We force the existence of a Suslin tree which is $n$-entangled, but all of whose derived trees of dimension $n+1$ are special, for any positive $n < ω$.
Suslin tree preservation and club isomorphisms
本文构造了存在Suslin树且特定正规Aronszajn树闭无界同构的集合论模型，还证明自由正规Suslin树经c.c.c.力迫可实现n-自由且高维导出树特殊的结果。
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $ω_1$ and $-ω_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration, proving that one can force CH together with a restricted form of ladder system uniformization on trees, all while preserving a rigid Suslin tree.
A Rigid Kurepa Tree From a Free Suslin Tree
本文通过分析自由 Suslin 树的可数支撑积，将其转化为无 Aronszajn 子树的高度刚性 Kurepa 树，并引入了树的新刚性性质。
Forcing Over a Free Suslin Tree
研究在自由苏斯林树上添加几乎不相交自同构的力迫，通过可数逼近进行。此力迫完全恰当，保持苏斯林性且不添加新共尾分支。特定条件下的乘积力迫解决了相关开放问题。
We investigate the unbalanced ordinary partition relations of the form $λ\rightarrow {(λ, α)}^{2}$ for various values of the cardinal $λ$ and the ordinal $α$. For example, we show that for every infinite cardinal $κ,$ the existence of a $κ^{+}-$Suslin tree implies $κ^{+} \not\rightarrow {\left( κ^{+}, {\log}_κ(κ^{+}) + 2 \right)}^{2}$. The consistency of the positive partition relation $\mathfrak{b} \rightarrow {(\mathfrak{b}, α)}^{2}$ for all $α< ω_{1}$ for the bounding number $\mathfrak{b}$ is also established from large cardinals.
Almost Kurepa Suslin trees and destructibility of the Guessing Model Property
本文证明了在ω₂处猜测模型原理与几乎Kurepa Suslin树存在的一致性，并展示了该原理可能被cccforcing破坏，同时探讨了弱Kurepa树与树性质的关系。
An almost Kurepa Suslin tree with strongly non-saturated square
本文构造Knaster力迫，添加一棵带ω₂个强几乎不相交自同构族的Suslin树，使其平方强非饱和，并引入ρ-分离新方法。
Preserving Non-Null with Suslin+ forcing
我们引入了有效公理A的概念，并用它来证明一些流行的树强迫是Suslin+。我们引入传递的棉结，并提出了一个简化版本的希拉的“保留一点意味着保留很多”：如果我是一个Suslin ccc理想（例如勒贝格空或微薄）和P是一个传递的棉结强迫（例如P是Suslin+）和P不使任何I-正博雷尔集小，那么P不使任何I-正集小。
The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin hypothesis. In particular, if $L(\mathbb{R}) \models \mathsf{AD}$, then $L(\mathbb{R})$ satisfies the Suslin hypothesis, which answers a question of Foreman.
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the Guessing Model Property and cardinal arithmetic, broadly construed. We improve upon results of Viale and Krueger by proving that a weakening of the Guessing Model Property implies Shelah's Strong Hypothesis. We also prove that, though the Guessing Model Property is known not to put an upper bound on the size of the continuum, it does imply that $2^{ω_1}$ is a…
New consequences of PFA($T^*$)
本文扩展了力迫公理 PFA($T^*$) 的推论列表，证明其蕴含映射反射原理（MRP）和开放图公理（OGA），并揭示了特殊 Aronszajn 树与几乎 Suslin 树在 club-同构性上的不同表现。
A forest is a generalization of a tree, and here we consider the Aronszajn and Suslin properties for forests. We focus on those forests satisfying coherence, a local smallness property. We show that coherent Aronszajn forests can be constructed within ZFC. We give several ways of obtaining coherent Suslin forests by forcing, one of which generalizes the well-known argument of Todorčević that a Cohen real adds a Suslin tree. Another uses a strong combinatorial principle that plays a similar role to diamond. We show that, starting from a large cardinal, this principle can be obtained by a forcin…
We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $ω_1^{ω_1}$. First, we will show that none of these classes have the Baire property (unless they are empty). Moreover, under $(V=L)$, (a) the class of Aronszajn and Suslin trees is $Π_1^1$-complete, (b) the class of special Aronszajn trees is $Σ_1^1$-complete, and (c) the class of Kurepa trees is $Π^1_2$-complete. We achieve these results by finding nicely definable reductions that map subsets $X$ of $ω_1$ to trees $T_X$ so that $T_X$ is in a given tree-c…
Square compactness and Lindelöf trees
本文证明弱方紧致基数必为强极限基数，并借助特定拓扑下的林德勒夫性刻画无不可数有限分叉子树的阿龙扎恩树，确定其严格介于苏斯林树与阿龙扎恩树之间。
We prove that the existence of a non-special tree of size $λ$ is equivalent to the existence of an uncountably chromatic graph with no $K_{ω_1}$ minor of size $λ$, establishing a connection between the special tree number and the uncountable Hadwiger conjecture. Also characterizations of Aronszajn, Kurepa and Suslin trees using graphs are deduced. A new generalized notion of connectedness for graphs is introduced using which we are able to characterize weakly compact cardinals.
Given a tree $T$ of height $ω_1$, we say that a ladder system colouring $(f_α)_{α\in \limω_1}$ has a $T$-uniformization if there is a function $φ$ defined on a subtree $S$ of $T$ so that for any $s\in S_α$ of limit height and almost all $ξ\in {dom} (f_α)$, $φ(s\upharpoonright ξ)=f_α(ξ)$. In sharp contrast to the classical theory of uniformizations on $ω_1$, J. Moore proved that CH is consistent with the statement that any ladder system colouring has a $T$-uniformization (for any Aronszajn tree $T$). Our goal is to present a fine analysis of ladder system uniformization on trees pointing out th…
Reversible and Irreversible Trees
本文通过往返系统刻画树的序型可逆性，证明不可逆性等价于存在临界节点或原型子树，并由此给出多类可逆树的存在性与判定条件。
$μ$-complete Souslin trees on $μ^+$
证明了$μ=μ^{<μ}$，$2^μ=μ^+$和"存在由共尾$<μ$序数组成的$μ^+$的非反射平稳子集“暗示了$μ^+$上存在$μ$ -完全Souslin树.
We study which $κ$-distributive forcing notions of size $κ$ can be embedded into tree Prikry forcing notions with $κ$-complete ultrafilters under various large cardinal assumptions. An alternative formulation -- can the filter of dense open subsets of a $κ$-distributive forcing notion of size $κ$ be extended to a $κ$-complete ultrafilter.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。