axiom of determinateness

The axiom of determinateness is a principle in mathematical logic that can be formulated in terms of an infinite game. In this game, two players choose digits to form a binary real number. One player wins if the number falls within a specific set S, while the other wins otherwise. The axiom states that one player always has a winning strategy, meaning the game is "determined."1

This axiom has significant implications, as it implies the axiom of choice for countable sets but is incompatible with the unrestricted axiom of choice. While weaker forms of the axiom are known to be consistent, it remains unknown if the unrestricted axiom of determinateness is consistent. The concept of determinateness in this context is distinct from philosophical determinism, which concerns the inevitability of all events.12