On the complexity of classes of uncountable structures: trees on \aleph₁

DOI10.4064/FM910-6-2020MaRDI QIDQ6319861arXivFDO

Authors Sy-David Friedman, Dániel T. Soukup

Publication date 3 June 2019

Published in arXiv

Full work available at URL https://doi.org/10.4064/FM910-6-2020

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Descriptive set theory (03E15) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50)

arXiv classification

math.LO

Abstract: We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $omeg{a}_1^{omeg{a}_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 $P{i}_1^1$-complete, (b) the class of special Aronszajn trees is $Sigm{a}_1^1$-complete, and (c) the class of Kurepa trees is $P{i}_2^1$-complete. We achieve these results by finding nicely definable reductions that map subsets $X$ of $omeg{a}_1$ to trees $T_X$ so that $T_X$ is in a given tree-class $mathcalT$ if and only if $X$ is stationary/non-stationary (depending on the class $mathcalT$). Finally, we present models of CH where these classes have lower projective complexity.

This page was built for publication: On the complexity of classes of uncountable structures: trees on $\aleph_1$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6319861)