A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Determinacy in third order arithmetic
2017
Annals of Pure and Applied Logic
In recent work, Schweber [7] introduces a framework for reverse mathematics in a third order setting and investigates several natural principles of transfinite recursion. The main result of that paper is a proof, using the method of forcing, that in the context of two-person perfect information games with moves in R, open determinacy (Σ R 1 -DET) is not implied by clopen determinacy (∆ R 1 -DET). In this paper, we give another proof of this result by isolating a level of L witnessing this
doi:10.1016/j.apal.2017.05.004
fatcat:65l5kfnpnnfkvngmsp367ecnci