@article{6d8f95c5b8884eafa4fc3224d3a0d12e,
title = "The axiom of real Blackwell determinacy",
abstract = "The theory of infinite games with slightly imperfect information has been developed for games with finitely and countably many moves. In this paper, we shift the discussion to games with uncountably many possible moves, introducing the axiom of real Blackwell determinacy Bl-AD ℝ (as an analogue of the axiom of real determinacy AD ℝ). We prove that the consistency strength of Bl-AD ℝ is strictly greater than that of AD.",
keywords = "Blackwell games, Consistency strength, Real determinacy, Sharps",
author = "Daisuke Ikegami and {de Kloet}, David and Benedikt L{\"o}we",
note = "Funding Information: The research of the first author was supported by a GLoRiClass fellowship funded by the European Commission (Early Stage Research Training Mono-Host Fellowship MEST-CT-2005-020841) and a grant by the Japan Society for the Promotion of Science; the work of the second author was done while he was at the Vrije Universiteit Amsterdam; the work of the third author was partially supported by the DFG-NWO Bilateral Grant KO 1353-5/1/DN 62-630. The authors should like to thank Vincent Kieftenbeld (Edwardsville IL) for discussions in the early phase of this project. They are grateful to an anonymous referee for suggesting a simpler proof of Lemma 11. ",
year = "2012",
month = oct,
doi = "10.1007/s00153-012-0291-x",
language = "English",
volume = "51",
pages = "671--685",
journal = "Archive for Mathematical Logic",
issn = "0933-5846",
publisher = "Springer New York",
number = "7-8",
}