Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T17:54:59.551Z Has data issue: false hasContentIssue false

PROVABLY $\Delta_1$ GAMES

Part of:Set theory

Published online by Cambridge University Press:  30 October 2020

J. P. AGUILERA
Affiliation:
INSTITUTE OF DISCRETE MATHEMATICS AND GEOMETRY VIENNA UNIVERSITY OF TECHNOLOGY WIEDNER HAUPTSTRAßE 8-10, 1040 VIENNA, AUSTRIADEPARTMENT OF MATHEMATICS, GHENT UNIVERSITY KRIJGSLAAN 281-S8, 9000 GHENT, BELGIUM E-mail: aguilera@logic.at
D. W. BLUE
Affiliation:
HARVARD LOGIC CENTER, HARVARD UNIVERSITY 2 ARROW STREET, CAMBRIDGE, MA 02138, USA E-mail: blue@g.harvard.edu
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 isolate two abstract determinacy theorems for games of length $\omega_1$ from work of Neeman and use them to conclude, from large-cardinal assumptions and an iterability hypothesis in the region of measurable Woodin cardinals that

  1. (1) if the Continuum Hypothesis holds, then all games of length $\omega_1$ which are provably $\Delta_1$-definable from a universally Baire parameter (in first-order or $\Omega $-logic) are determined;

  2. (2) all games of length $\omega_1$ with payoff constructible relative to the play are determined; and

  3. (3) if the Continuum Hypothesis holds, then there is a model of ${\mathsf{ZFC}}$ containing all reals in which all games of length $\omega_1$ definable from real and ordinal parameters are determined.

MSC classification

Information

Type
Articles
Copyright
© The Association for Symbolic Logic 2020