Semantic A-translation and Super-consistency entail Classical Cut Elimination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Semantic A-translation and Super-consistency entail Classical Cut Elimination

Abstract

We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly normalize in natural deduction modulo R, and that cut elimination holds in the intuitionistic sequent calculus modulo R. We first define a syntactic and a semantic version of Friedman's A-translation, showing that it preserves the structure of pseudo-Heyting algebra, our semantic framework. Then we relate the interpretation of a theory in the A-translated algebra and its A-translation in the original algebra. This allows to show the stability of the super-consistency criterion and the cut elimination theorem.
Fichier principal
Vignette du fichier
SemanticTranslation.pdf (185.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00923915 , version 1 (05-01-2014)

Identifiers

Cite

Lisa Allali, Olivier Hermant. Semantic A-translation and Super-consistency entail Classical Cut Elimination. LPAR 19 - 19th Conference on Logic for Programming, Artificial Intelligence, and Reasoning - 2013, Bernd Fischer, Geoff Sutcliffe, Dec 2013, Stellenbosch, South Africa. pp.407-422, ⟨10.1007/978-3-642-45221-5_28⟩. ⟨hal-00923915⟩
632 View
99 Download

Altmetric

Share

Gmail Facebook X LinkedIn More