Binary choice games and arithmetical comprehension

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.

Authors

Publication Details

Journal
Archive for Mathematical Logic
Published
2026-05-09
DOI
https://doi.org/10.1007/s00153-026-01016-4
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Binary choice games and arithmetical comprehension

J. P. Aguilera, T. Kouptchinsky
Archive for Mathematical Logic
Game Theory and Voting Systems
article

Binary choice games and arithmetical comprehension

J. P. Aguilera, T. Kouptchinsky
article en

Abstract

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.

Archive for Mathematical Logic
Austrian Science Fund
Openalex Percentile: Top 3%
Game Theory and Voting Systems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Binary choice games and arithmetical comprehension — J. P. Aguilera, T. Kouptchinsky · Archive for Mathematical Logic (2026) | TGRS Research Map | TGRS