2000 character limit reached
On wide Aronszajn trees in the presence of MA
Published 6 Feb 2020 in math.LO | (2002.02396v5)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.