2024/07/27 by Pierre Simon, Simon, Pierre, Mariana Vicaria +1
Mathematics · Computer Science · #Advanced Topology and Set Theory #Logic, programming, and type systems #Advanced Graph Theory Research
paper · pdf · doi:10.48550/arxiv.2407.19336
We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in \ACVF. Furthermore, we demonstrate that any stable set in an \NIP theory has the bounded stabilizing property. This result is subsequently used to correct Proposition 6.7 from the book on stable domination and independence in \ACVF.