On the Convergence of Reduction-based and Model-based Methods in Proof Theory

Authors:
Gilles Dowek
Affiliations:
École polytechnique and INRIA, LIX, École polytechnique, 91128 Palaiseau Cedex, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 10
Cited 0

Stratification and cut-elimination

Journal of Symbolic Logic
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
Theorem Proving Modulo

Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic

Mathematical Structures in Computer Science
Completeness and Cut-elimination in the Intuitionistic Theory of Types

Journal of Logic and Computation
Embedding pure type systems in the lambda-pi-calculus modulo

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Truth values algebras and proof normalization

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Semantic cut elimination in the intuitionistic sequent calculus

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Arithmetic as a theory modulo

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Superdeduction at work

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

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.