Year: 2026
Type: article
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.
Source: Archive for Mathematical Logic
Authors: J. P. Aguilera, T. Kouptchinsky
Institution: TU Wien
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,190
Funder: Austrian Science Fund
OpenAlex ID: W7160718827