A semantic normalization proof for a system with recursors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2008

A semantic normalization proof for a system with recursors

Abstract

Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extend to prove strong normalization results, in particular for theories in deduction modulo. However such semantic methods did not apply for systems with recursors like Godel system T. We show in this paper how super natural deduction provides a bridge between superconsistency of arithmetic and strong normalization of system T. We then generalize this result to a family of inductive types before discussing the dependant case.
Fichier principal
Vignette du fichier
paper.pdf (174.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00211877 , version 1 (22-01-2008)

Identifiers

  • HAL Id : inria-00211877 , version 1

Cite

Lisa Allali, Paul Brauner. A semantic normalization proof for a system with recursors. 2008. ⟨inria-00211877⟩
165 View
111 Download

Share

Gmail Facebook X LinkedIn More