Binary Choice Games and Arithmetical Comprehension
arXiv:2510.12612
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.
arXiv:2510.12612
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.