Abstract

The paper studies determinacy of Schmidt and other intersection games and proves determinacy results under AD. Its §2 background theorem records Martin's ZFC determinacy theorem for Borel games, the result used by arXiv v3 of the focal paper.

Role in dependence graphs

Proof-critical source

On Nontrivial Winning and Losing Parameters of Schmidt Games

This paper is included only for the following marked statement:

  • Borel-game determinacy theorem · §2, theorem attributed to Martin (and to Hurkens–Neeman for quasi-strategies)All Borel games on a nonempty move set with a tree of legal plays are determined in ZFC; the Borel Schmidt games used in the endpoint argument are an instance.

AI-generated audit

Audit summary

Not a correctness certificate. These reports do not replace expert scrutiny or formal verification.

No audit has been generated for this published version.