Abstract

The Axiom of Blackwell Determinacy is a set-theoretic axiom motivated by games used in statistics. It is known that the Axiom of Determinacy implies the Axiom of Blackwell Determinacy. Tony Martin has conjectured that the two axioms are equivalent.

We develop the “simulation technique” which allows us to simulate boundedness proofs under the assumption of Blackwell Determinacy and deduce strong combinatorial consequences that can be seen as an important step towards proving Tony Martin’s conjecture.

Authors