2019/06/27 by J. P. Aguilera, Aguilera, J. P.
Mathematics · Computer Science · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.1906.11757
It is shown that Borel games of length ω2 are determined if, and only if, for every countable ordinal α, there is a fine-structural, countably iterable extender model of Zermelo set theory with α-many iterated powersets above a limit of Woodin cardinals.