Games: Unifying Logic, Language, and Philosophy pp 351-370 | Cite as

# The Problem of Determinacy of Infinite Games from an Intuitionistic Point of View

## Abstract

Taking Brouwer's intuitionistic standpoint, we examine finite and infinite games of perfect information for players *I* and *II*. If one understands the disjunction occurring in the classical notion of determinacy constructively, even finite games are not always determinate. We therefore suggest an intuitionistically different notion of determinacy and prove that every subset of Cantor space is determinate in the proposed sense. Our notion is biased and considers games from the viewpoint of player *I*. In Cantor space, both player *I* and player *II* have two alternative possibilities for each move. It turns out that every subset of a space, where player *II* has, for each one of his moves, no more than a finite number of alternative possibilities while player *I* perhaps has infinitely many choices, is determinate in the proposed sense from the viewpoint of player *I*.

## Keywords

Natural Number Winning Strategy Classical Point Baire Space Cantor Space## Preview

Unable to display preview. Download preview PDF.

## References

- Carroll, L. (1865).
*Alice's Adventures in Wonderland, Through the Looking-Glass, and Other Writings*. Collins, London, Glasgow.Google Scholar - Davis, M. (1964). Infinite games of perfect information.
*Ann. Math. Stud.*, 52:85–101.Google Scholar - Gielen, W., de Swart, H., and Veldman, W. (1981). The continuum hypothesis in intuitionism.
*J. Symb. Logic*, 46:121–136.CrossRefGoogle Scholar - Hausdorff, F. (1908). Grundzüge einer theorie der geordneten mengen.
*Math. Ann.*, 65:435–505.CrossRefGoogle Scholar - Kechris, A. S. (1995).
*Classical Descriptive Set Theory*. Springer, New York.Google Scholar - Kleene, S. C. and Vesley, R. E. (1965).
*The Foundations of Intuitionistic Mathematics, Especially in Relation to Recursive Functions*. Studies in Logic and the Foundations of Mathematics. North Holland, Amsterdam.Google Scholar - Moschovakis, J. R. (1980a). Review of Veldman, 1982. In
*Mathematical Reviews*, MR 85g:03089.Google Scholar - Moschovakis, Y. N. (1980b).
*Descriptive Set Theory, volume 100 of Studies in Logic and the Foundations of Mathematics*. North Holland, Amsterdam.Google Scholar - Rosenstein, J. G. (1982).
*Linear Orderings*. Academic, New York.Google Scholar - Troelstra, A. S. and van Dalen, D. (1988).
*Constructivism in Mathematics, an Introduction. Volumes I and II*, volumes 121 and 123 of*Studies in Logic and the Foundations of Mathematics*. North Holland, Amsterdam.Google Scholar - Veldman, W. (1981).
*Investigations in intuitionistic hierarchy theory*. PhD thesis, Katholieke Universiteit Nijmegen, Nijmegen.Google Scholar - Veldman, W. (1982). On the contraposition of two axioms of countable choice. In Troelstra, A. S. and van Dalen, D., editors,
*Brouwer Centenary Symposium*, volume 110, pages 513– 523, North Holland, Amsterdam.Google Scholar - Veldman, W. (2005). The fan theorem as an axiom and as a contrast to Kleene's alternative. Report no. 0509, Department of Mathematics, Radboud University, Nijmegen.Google Scholar
- Veldman, W. (2006a). The borel hierarchy and the projective hierarchy from Brouwer's intuitionistic perspective. Report no. 0604, Department of Mathematics, Radboud University, Nijmegen.Google Scholar
- Veldman, W. (2006b). Brouwer's real thesis on bars.
*Philosophia Scientiæ*, 6:21–42.Google Scholar