Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T16:47:37.302Z Has data issue: false hasContentIssue false

$F_\sigma $ GAMES AND REFLECTION IN $L(\mathbb {R})$

Published online by Cambridge University Press:  21 July 2020

J. P. AGUILERA*
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF GHENT KRIJGSLAAN 281-S8, 9000 GHENT, BELGIUMINSTITUTE OF DISCRETE MATHEMATICS AND GEOMETRY VIENNA UNIVERSITY OF TECHNOLOGY WIEDNER HAUPTSTRAßE 8-10, 1040 VIENNA, AUSTRIA E-mail: aguilera@logic.at
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We characterize the determinacy of $F_\sigma $ games of length $\omega ^2$ in terms of determinacy assertions for short games. Specifically, we show that $F_\sigma $ games of length $\omega ^2$ are determined if, and only if, there is a transitive model of ${\mathsf {KP}}+{\mathsf {AD}}$ containing $\mathbb {R}$ and reflecting $\Pi _1$ facts about the next admissible set.

As a consequence, one obtains that, over the base theory ${\mathsf {KP}} + {\mathsf {DC}} + ``\mathbb {R}$ exists,” determinacy for $F_\sigma $ games of length $\omega ^2$ is stronger than ${\mathsf {AD}}$, but weaker than ${\mathsf {AD}} + \Sigma _1$-separation.

Information

Type
Articles
Copyright
© The Association for Symbolic Logic 2020