HAL: hal-00150697, version 1

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

A simple proof that super-consistency implies cut elimination

Gilles Dowek 1, Olivier Hermant 2

(2007)

We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes ideas from the semantic proofs of cut elimination that proceed by proving the completeness of the cut free calculus. In particular, it gives a generalization, to all super-consistent theories, of the notion of V-complex, introduced in the semantic cut elimination proofs for simple type theory.

1:	Laboratoire d'informatique de l'école polytechnique (LIX)
	CNRS : UMR7161 – Polytechnique - X
2:	Preuves, Programmes et Systèmes (PPS)
	CNRS : UMR7126 – Université Paris VII - Paris Diderot

Subject

:

Computer Science/Logic in Computer Science

hal-00150697, version 1

http://hal.archives-ouvertes.fr/hal-00150697

oai:hal.archives-ouvertes.fr:hal-00150697

From: Olivier Hermant <>

Submitted on: Sunday, 1 July 2007 07:00:02

Updated on: Sunday, 1 July 2007 07:00:02