The determinacy strength of Π21-comprehension

https://doi.org/10.1016/j.apal.2010.04.012Get rights and content
Under an Elsevier user license
open archive

Abstract

Determinacy axioms state the existence of winning strategies for infinite games played by two players on natural numbers. We show that a base theory enriched by a certain scheme of determinacy axioms is proof-theoretically equivalent to Π21-comprehension.

MSC

03B30
03F35

Keywords

Reverse mathematics
Determinacy
Second-order arithmetic

Cited by (0)

1

Current address: Zur Wipperaller 28, 38448 Wolfsburg, Germany.