Abstract
PDF (193 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
doi:10.1016/j.entcs.2008.03.070 
Copyright © 2008 Elsevier B.V. All rights reserved.
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
Gilles Doweka, 
Available online 8 April 2008.
Abstract
In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper details some of the steps of this transformation.
Keywords: Cut elimination; reducibility candidates; models; truth values algebras
References
L. Allali. Algorithmic equality in Heyting arithmetic modulo. Higher Order Rewriting, 2007.
P.B. Andrews, Resolution in type theory, The Journal of Symbolic Logic 36 (3) (1971), pp. 414–432.
P. Brauner, C. Houtmann and C. Kirchner, Superdeduction at work, Rewriting, Computation and Proof, Essays dedicated to Jean-Pierre Jouannaud on the occasion of his 60th birthday, Lectures Notes in Computer Science 4600, Springer (2007), pp. 132–166.
P. Brauner, G. Dowek, and B. Wack. Normalization in supernatural deduction and in deduction modulo. Manuscript, 2007.
Th. Coquand, Personal communication.
D. Cousineau and G. Dowek, Embedding Pure Types Systems in the lambda Pi-calculus modulo, Typed Lambda calculi and Applications, Lecture Notes in Computer Science 4583, Springer (2007), pp. 102–117.
M. Crabbé. Non-normalisation de la théorie de Zermelo. Manuscript, 1974.
M. Crabbé, Stratification and cut-elimination, The Journal of Symbolic Logic 56 (1) (1991), pp. 213–226.
M. De Marco and J. Lipton, Completeness and cut-elimination in the intuitionistic theory of types, Journal of Logic and Computation 15 (2005), pp. 821–854. View Record in Scopus | Cited By in Scopus (5)
G. Dowek, About folding-unfolding cuts and cuts modulo, Journal of Logic and Computation 11 (3) (2001), pp. 419–429. View Record in Scopus | Cited By in Scopus (2)
G. Dowek, Truth values algebras and proof normalization, TYPES 2006, Lectures Notes in Computer Science 4502, Springer (2007).
G. Dowek, T. Hardin and C. Kirchner, Theorem proving modulo, Journal of Automated Reasoning 31 (2003), pp. 32–72.
G. Dowek, T. Hardin and C. Kirchner, HOL-lambda-sigma: an intentional first-order expression of higher-order logic, Mathematical Structures in Computer Science 11 (2001), pp. 1–25.
G. Dowek and O. Hermant, A simple proof that super-consistency implies cut elimination, Rewriting techniques and applications, Lecture Notes in Computer Science 4533 (2007), pp. 96–106.
G. Dowek and B. Werner, Proof normalization modulo, The Journal of Symbolic Logic 68 (4) (2003), pp. 1289–1316. View Record in Scopus | Cited By in Scopus (13)
G. Dowek and B. Werner, Arithmetic as a theory modulo, Term rewriting and applications, Lecture Notes in Computer Science 3467, Springer (2005), pp. 423–437.
J. Ekman. Normal proofs in set theory. Doctoral thesis, Chalmers university of technology and University of Göteborg, 1994.
J.-Y. Girard, Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types, 2nd Scandinavian Logic Symposium, Noth Holland (1971), pp. 63–92.
J.-Y. Girard, Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Doctoral thesis, Université de Paris 7, 1972.
L. Hallnäs. On normalization of proofs in set theory. Doctoral thesis, University of Stockholm, 1983.
O. Hermant. Méthodes sémantiques en déduction modulo. Doctoral Thesis, Université de Paris 7, 2005.
O. Hermant, Semantic cut elimination in the intuitionistic sequent calculus, Typed Lambda Calculi and Applications, Lectures Notes in Computer Science 3461, Springer (2005), pp. 221–233.
M. Okada, A uniform semantic proof for cut elimination and completeness of various first and higher order logics, Theoretical Computer Science 281 (2002), pp. 471–498. Abstract | 
PDF (201 K)
| View Record in Scopus | Cited By in Scopus (14)
PDF (201 K)
| View Record in Scopus | Cited By in Scopus (14)M. Parigot. Strong normalization for the second orclassical natural deduction. Logic in Computer Science, 39–46, 1993.
D. Prawitz, Hauptsatz for higher order logic, The Journal of Symbolic Logic 33 (1968), pp. 452–457.
D. Prawitz, Natural Deduction. A Proof-Theoretical Study, Almqvist and Wiksell (1965).
W.W. Tait, A non constructive proof of Gentzen's Hauptsatz for second order predicate logic, Bulletin of the American Mathematical Society 72 (1966), pp. 980–983.
W.W. Tait, Intentional interpretations of functionals of finite type I, The Journal of Symbolic Logic 32 (1967), pp. 198–212.
M.o. Takahashi, A proof of cut-elimination theorem in simple type theory, Journal of the Mathematical Society of Japan 19 (1967), pp. 399–410.
B. Wack. Typage et déduction dans le calcul de réécriture. Doctoral Thesis, Université Henri Poincaré Nancy 1, 2005.
B. Werner. Une théorie des constructions inductives. Doctoral Thesis, Université de Paris 7, 1994.
