The length of some diagonalization games

Archive for Mathematical Logic 38 (2):103-122 (1999)
  Copy   BIBTEX

Abstract

For X a separable metric space and $\alpha$ an infinite ordinal, consider the following three games of length $\alpha$ : In $G^{\alpha}_1$ ONE chooses in inning $\gamma$ an $\omega$ –cover $O_{\gamma}$ of X; TWO responds with a $T_{\gamma}\in O_{\gamma}$ . TWO wins if $\{T_{\gamma}:\gamma<\alpha\}$ is an $\omega$ –cover of X; ONE wins otherwise. In $G^{\alpha}_2$ ONE chooses in inning $\gamma$ a subset $O_{\gamma}$ of ${\sf C}_p(X)$ which has the zero function $\underline{0}$ in its closure, and TWO responds with a function $T_{\gamma}\in O_{\gamma}$ . TWO wins if $\underline{0}$ is in the closure of $\{T_{\gamma}:\gamma<\alpha\}$ ; otherwise, ONE wins. In $G^{\alpha}_3$ ONE chooses in inning $\gamma$ a dense subset $O_{\gamma}$ of ${\sf C}_p(X)$ , and TWO responds with a $T_{\gamma}\in O_{\gamma}$ . TWO wins if $\{T_{\gamma}:\gamma<\alpha\}$ is dense in ${\sf C}_p(X)$ ; otherwise, ONE wins. After a brief survey we prove: 1. If $\alpha$ is minimal such that TWO has a winning strategy in $G^{\alpha}_1$ , then $\alpha$ is additively indecomposable (Theorem 4) 2. For $\alpha$ countable and minimal such that TWO has a winning strategy in $G^{\alpha}_1$ on X, the following statements are equivalent (Theorem 9): a) TWO has a winning strategy in $G^{\alpha}_2$ on ${\sf C}_p(X)$ . b) TWO has a winning strategy in $G^{\alpha}_3$ on ${\sf C}_p(X)$ . 3. The Continuum Hypothesis implies that there is an uncountable set X of real numbers such that TWO has a winning strategy in $G^{\omega^2}_1$ on X (Theorem 10)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An ordinal partition avoiding pentagrams.Jean Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Improving a Bounding Result That Constructs Models of High Scott Rank.Christina Goddard - 2016 - Notre Dame Journal of Formal Logic 57 (1):59-71.

Analytics

Added to PP
2013-11-23

Downloads
20 (#1,027,136)

6 months
2 (#1,692,400)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On some questions about selective separability.Liljana Babinkostova - 2009 - Mathematical Logic Quarterly 55 (5):539-541.

Add more citations

References found in this work

No references found.

Add more references