2026-07-22T04:52:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3682 2024-03-06T10:34:22Z ddc:004 open_access

A Computational Interpretation of the Axiom of Determinacy in Arithmetic Hida, Takanori The axiom of determinacy Gale-Stewart’s theorem Syntactic continuity Realizability interpretation Coquand’s game semantics We investigate the computational content of the axiom of determinacy (AD) in the setting of classical arithmetic in all finite types with the principle of dependent choices (DC). By employing the notion of realizability interpretation for arithmetic given by Berardi, Bezem and Coquand (1998), we interpret the negative translation of AD. Consequently, the combination of the negative translation with this realizability semantics can be seen as a model of DC, AD and the negation of the axiom of choice at higher types. In order to understand the computational content of AD, we explain, employing Coquand's game theoretical semantics, how our realizer behaves. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Takanori Hida 2012 Is Part Of LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2012.335 urn:nbn:de:0030-drops-36828 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.335 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode