2 papers
math.LO2025
Binary Choice Games and Arithmetical Comprehension
Juan Pablo Aguilera, Thibaut Kouptchinsky
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.
math.LO2024
The Limits of Determinacy in Higher-Order Arithmetic
Juan Pablo Aguilera, Thibaut Kouptchinsky
We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and…