Interactive Realizability for Second-Order Heyting Arithmetic with EM1 and SK1 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2012

Interactive Realizability for Second-Order Heyting Arithmetic with EM1 and SK1

Abstract

We introduce a classical realizability semantics based on interactive learning for full second-order Heyting Arithmetic with excluded middle and Skolem axioms over Sigma01-formulas. Realizers are written in a classical version of Girard's System F. Since the usual computability semantics does not apply to such a system, we introduce a constructive forcing/computability semantics: though realizers are not computable functional in the sense of Girard, they can be forced to be computable. We apply these semantics to show how to extract witnesses from realizable Pi02-formulas. In particular a constructive and efficient method is introduced. It is based on a new ''(state-extending-continuation)-passing-style translation'' whose properties are described with the constructive forcing/computability semantics.
Fichier principal
Vignette du fichier
RealizersHASEM1final.pdf (564.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00657054 , version 1 (05-01-2012)
hal-00657054 , version 2 (05-03-2012)

Identifiers

  • HAL Id : hal-00657054 , version 2

Cite

Federico Aschieri. Interactive Realizability for Second-Order Heyting Arithmetic with EM1 and SK1. 2012. ⟨hal-00657054v2⟩
113 View
232 Download

Share

Gmail Facebook X LinkedIn More