.png){kind=icon}
.png){kind=icon}
Return
Binary choice games and arithmetical comprehension
.png){kind=icon}
OA
AI
DOI：10.1007/s00153-026-01016-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Reverse mathematics
Determinacy
Weak Konig's lemma
Journal
A
IF:
0.4
Papers:
34
Citations:
0