Proof normalization modulo

Journal of Symbolic Logic 68 (4):1289-1316 (2003)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1067620188
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,334
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
22 ( #255,743 of 2,225,327 )

Recent downloads (6 months)
1 ( #425,048 of 2,225,327 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature