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.
| Original language | English |
|---|---|
| Pages (from-to) | 671-685 |
| Number of pages | 15 |
| Journal | Archive for Mathematical Logic |
| Volume | 51 |
| Issue number | 7-8 |
| DOIs | |
| Publication status | Published - 2012 Oct 1 |
Keywords
- Blackwell games
- Consistency strength
- Real determinacy
- Sharps
ASJC Scopus subject areas
- Philosophy
- Logic
Fingerprint Dive into the research topics of 'The axiom of real Blackwell determinacy'. Together they form a unique fingerprint.
Cite this
Ikegami, D., de Kloet, D., & Löwe, B. (2012). The axiom of real Blackwell determinacy. Archive for Mathematical Logic, 51(7-8), 671-685. https://doi.org/10.1007/s00153-012-0291-x