A Type Theory which is complete for Kreisel's Modified Realizability - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 1999

A Type Theory which is complete for Kreisel's Modified Realizability

Abstract

We define a type theory with a strong elimination rule for existential quantification. As in Martin-Löf's type theory, the “axiom of choice” is thus derivable. Proofs are also annotated by realizers which are simply typed lambda-terms. A new rule called “type extraction” which extracts the type of a realizer allows us to derive the so-called “independance of premisses” schema. Consequently, any formula which is realizable in HA^omega according to Kreisel's modified realizability, is derivable in this type theory.
No file

Dates and versions

hal-00094650 , version 1 (14-09-2006)

Identifiers

  • HAL Id : hal-00094650 , version 1

Cite

Tristan Crolard. A Type Theory which is complete for Kreisel's Modified Realizability. Electronic Notes in Theoretical Computer Science, 1999, 23, pp.1-16. ⟨hal-00094650⟩

Collections

CNRS LACL UPEC
47 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More