December 2003 Proof normalization modulo
Gilles Dowek, Benjamin Werner
J. Symbolic Logic 68(4): 1289-1316 (December 2003). DOI: 10.2178/jsl/1067620188

Abstract

We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theories having a so-called pre-model. As a corollary, we retrieve cut elimination for several axiomatic theories, including Church’s simple type theory.

Citation

Download Citation

Gilles Dowek. Benjamin Werner. "Proof normalization modulo." J. Symbolic Logic 68 (4) 1289 - 1316, December 2003. https://doi.org/10.2178/jsl/1067620188

Information

Published: December 2003
First available in Project Euclid: 31 October 2003

zbMATH: 1059.03062
MathSciNet: MR2017356
Digital Object Identifier: 10.2178/jsl/1067620188

Rights: Copyright © 2003 Association for Symbolic Logic

JOURNAL ARTICLE
28 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.68 • No. 4 • December 2003
Back to Top