The canonical function game

Archive for Mathematical Logic 44 (7):817-827 (2005)
  Copy   BIBTEX


The canonical function game is a game of length ω1 introduced by W. Hugh Woodin which falls inside a class of games known as Neeman games. Using large cardinals, we show that it is possible to force that the game is not determined. We also discuss the relationship between this result and Σ22 absoluteness, cardinality spectra and Π2 maximality for H(ω2) relative to the Continuum Hypothesis.



    Upload a copy of this work     Papers currently archived: 89,560

External links

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

Through your library


Added to PP

31 (#439,275)

6 months
12 (#120,845)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Some results about (+) proved by iterated forcing.Tetsuya Ishiu & Paul B. Larson - 2012 - Journal of Symbolic Logic 77 (2):515-531.
Games of length ω1.Itay Neeman - 2007 - Journal of Mathematical Logic 7 (1):83-124.
The stationary set splitting game.Paul B. Larson & Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (2):187-193.
Provably games.J. P. Aguilera & D. W. Blue - forthcoming - Journal of Symbolic Logic:1-22.

View all 6 citations / Add more citations

References found in this work

Bounding by canonical functions, with ch.Paul Larson & Saharon Shelah - 2003 - Journal of Mathematical Logic 3 (02):193-215.
Games of length ω1.Itay Neeman - 2007 - Journal of Mathematical Logic 7 (1):83-124.

Add more references