加载中…
A wide Aronszajn tree is a tree of size and height with no uncountable branches. We prove that under there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler and V"a"an"anen from 1994. We also prove that under the same assumption there is no universal Aronszajn tree, improving a result of Todor\v{c}evi{'c} from 2007 who proved the same under the assumption of BPFA for posets of size . Finally, we prove that under , every wide Aronszajn tree weakly embeds in an Aronszajn tree.

生成讲解博客的中文版本

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