LIPIcs.CSL.2012.335.pdf
- Filesize: 0.49 MB
- 15 pages
Document
A Computational Interpretation of the Axiom of Determinacy in Arithmetic
Author
-
Part of:
Volume:
Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (CSL 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2012-09-03
Cite As Get BibTex
Takanori Hida. A Computational Interpretation of the Axiom of Determinacy in Arithmetic. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 335-349, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.CSL.2012.335
Abstract
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.
Subject Classification
Keywords
- The axiom of determinacy
- Gale-Stewart’s theorem
- Syntactic continuity
- Realizability interpretation
- Coquand’s game semantics
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads