MathAudit

Publication metadata

Journal citation
Recursion Theory (Ithaca, N.Y., 1982), Proceedings of Symposia in Pure Mathematics 42, 303–308 (1985)
Publication date
1985
MSC 2020
03E05, 03E60
As specified in the publication (MSC 1980)
03E05, 03E60 ↗First page of Martin's author-hosted reprint/supporting copy (primary 03E05; secondary 03E60)The codes are printed in the paper. The local graph display should retain them only after the app's official MSC1980-to-MSC2020 conversion policy is applied.

Abstract

The proceedings paper gives a transfinite-inductive proof that all Borel infinite perfect-information games are determined.

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:

  • Purely inductive Borel-determinacy theorem · official cited article pp. 303–308; theorem and corollary in the six-page paperProves by transfinite induction that Borel payoff sets yield determined infinite perfect-information games.

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.