Axiom of determinacy¶
A set-theoretic axiom asserting that every infinite two-player perfect-information game on natural numbers has a winning strategy for one player.
Core Idea¶
The payoff-set universe must be specified; full AD contradicts choice, while projective and local determinacy principles have different consistency strengths. Players alternately choose naturals to form an infinite sequence, and the axiom requires one player to possess a strategy forcing membership in or outside the payoff set. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
The load-bearing residual is not the broad topic of set theory. It is the domain-specific identity fixed by the ambient set theory and universe of payoff sets, game length and move set, information and alternation, payoff set, strategy, winning condition, determinacy quantifier and relationship to choice and regularity consequences are explicit.
Scope of Application¶
Axiom of determinacy belongs to set theory and is useful where the analyst can specify the typed set theory carrier, including objects, relations, parameters, conventions, evidence, and comparison cases, then evaluate the ambient set theory and universe of payoff sets, game length and move set, information and alternation, payoff set, strategy, winning condition, determinacy quantifier and relationship to choice and regularity consequences are explicit. The scope is broad within that domain but bounded by the need for the ambient set theory and universe of payoff sets, game length and move set, information and alternation, payoff set, strategy, winning condition, determinacy quantifier and relationship to choice and regularity consequences are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the ambient set theory and universe of payoff sets, game length and move set, information and alternation, payoff set, strategy, winning condition, determinacy quantifier and relationship to choice and regularity consequences are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Axiom of determinacy. Axiom of determinacy compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed set theory carrier, including objects, relations, parameters, conventions, evidence, and comparison cases. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the ambient set theory and universe of payoff sets, game length and move set, information and alternation, payoff set, strategy, winning condition, determinacy quantifier and relationship to choice and regularity consequences are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of set theory because they reuse the typed set theory carrier, including objects, relations, parameters, conventions, evidence, and comparison cases, Players alternately choose naturals to form an infinite sequence, and the axiom requires one player to possess a strategy forcing membership in or outside the payoff set., and type the carrier, state every parameter and convention in the definition, test that the ambient set theory and universe of payoff sets, game length and move set, information and alternation, payoff set, strategy, winning condition, determinacy quantifier and relationship to choice and regularity consequences are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Axiom of determinacy Domain-specific
Parents (1) — more general patterns this builds on
-
Axiom of determinacy is a kind of Determinism Prime
The proposed strict upward parent is
prime:determinism.
Hierarchy path (1) — routes to 1 parentless root
- Axiom of determinacy → Determinism → Causality → Dependency
Neighborhood in Abstraction Space¶
Axiom of determinacy sits in a crowded region of the domain-specific corpus (32nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Dynamic, Topological & Designed Games (9 abstractions)
Nearest neighbors
- Outcome (game theory) — 0.90
- Tarski–Grothendieck set theory — 0.90
- Non-cooperative game theory — 0.90
- Markov strategy — 0.90
- Differential game — 0.90
Computed from structural-signature embeddings · 2026-09-08