Papers
Topics
Authors
Recent
Search
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 ω1\omega_1 with no uncountable branches. We prove that under MA(ω1)MA(\omega_1) 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 ℵ1\aleph_1. Finally, we prove that under MA(ω1)MA(\omega_1), every wide Aronszajn tree weakly embeds in an Aronszajn tree.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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