Definable Towers
Preprint
Abstract
We study the definability of maximal towers and of inextendible linearly ordered towers (ilt's), a notion that is more general than that of a maximal tower. We show that there is, in the constructible universe, a $\Pi^1_1$ definable maximal tower that is indestructible by any proper Suslin poset. We prove that the existence of a $\Sigma^1_2$ ilt implies that $\omega_1 = \omega_1^L$. Moreover we show that analogous results hold for other combinatorial families of reals. We prove that there is no ilt in Solovay's model. And finally we show that the existence of a $\Sigma^1_2$ ilt is equivalent to that of a $\Pi^1_1$ maximal tower.
Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Compactness of maximal eventually different familiesBulletin of the London Mathematical Society, 2018
- Mad Families Constructed from Perfect Almost Disjoint FamiliesThe Journal of Symbolic Logic, 2013
- Co-analytic mad families and definable wellordersArchive for Mathematical Logic, 2013
- Comparing the closed almost disjointness and dominating numbersFundamenta Mathematicae, 2012
- Infinite combinatorics and definabilityAnnals of Pure and Applied Logic, 1989