Binary Choice Games and Arithmetical Comprehension
Logic
2025-10-15 v1
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.
Keywords
Cite
@article{arxiv.2510.12612,
title = {Binary Choice Games and Arithmetical Comprehension},
author = {Juan Pablo Aguilera and Thibaut Kouptchinsky},
journal= {arXiv preprint arXiv:2510.12612},
year = {2025}
}