Skip to Main content Skip to Navigation
Journal articles

Classical realizability and arithmetical formulæ

Mauricio Guillermo 1 Étienne Miquey 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
Inria de Paris, CNRS - Centre National de la Recherche Scientifique, IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale, UPD7 - Université Paris Diderot - Paris 7
Abstract : In this paper we treat the specification problem in Krivine classical realizability, in the case of arithmetical formulæ. In the continuity of previous works from Miquel and the first author, we characterize the universal realizers of a formula as being the winning strategies for a game (defined according to the formula). In the first sections we recall the definition of classical realizability, as well as a few technical results. In Section 5, we introduce in more details the specification problem and the intuition of the game-theoretic point of view we adopt later. We first present a game $\G^{1}$, that we prove to be adequate and complete if the language contains no instructions `quote', using interaction constants to do substitution over execution threads. We then show that as soon as the language contain `quote', the game is no more complete, and present a second game $\G^{2}$ that is both adequate and complete in the general case. In the last Section, we draw attention to a model-theoretic point of view and use our specification result to show that arithmetical formulæ are absolute for realizability models.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01247989
Contributor : Étienne Miquey <>
Submitted on : Wednesday, March 30, 2016 - 10:28:52 PM
Last modification on : Friday, April 10, 2020 - 5:13:45 PM
Long-term archiving on: : Monday, November 14, 2016 - 10:06:24 AM

File

main.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Mauricio Guillermo, Étienne Miquey. Classical realizability and arithmetical formulæ. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2016, ⟨10.1017/S0960129515000559⟩. ⟨hal-01247989⟩

Share

Metrics

Record views

688

Files downloads

1180