Binary Choice Games and Arithmetical Comprehension
Authors
Juan Pablo Aguilera
Thibaut Kouptchinsky
Abstract
We prove that Arithmetical Comprehension is equivalent to the determinacy of all clopen integer games in which each player has at most two moves per turn.
