2000 character limit reached
Club isomorphisms on higher Aronszajn trees (1708.00528v3)
Published 1 Aug 2017 in math.LO
Abstract: We prove the consistency, assuming an ineffable cardinal, that any two normal countably closed $\omega_2$-Aronszajn trees are club isomorphic. This work generalizes to higher cardinals the property of Abraham-Shelah that any two normal $\omega_1$-Aronszajn trees are club isomorphic, which follows from $\textsf{PFA}$. The statement that any two normal countably closed $\omega_2$-Aronszajn trees are club isomorphic implies that there are no $\omega_2$-Suslin trees, so our proof also expands on the method of Laver-Shelah for obtaining the $\omega_2$-Suslin hypothesis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.