Abstract
Cut-free proofs in Herbelin’s sequent calculus are in 1-1 correspondence with normal natural deduction proofs. For this reason Herbelin’s sequent calculus has been considered a privileged middle-point between L-systems and natural deduction. However, this bijection does not extend to proofs containing cuts and Herbelin observed that his cutelimination procedure is not isomorphic to β-reduction.
In this paper we equip Herbelin’s system with rewrite rules which, at the same time: (1) complete in a sense the cut elimination procedure firstly proposed by Herbelin; and (2) perform the intuitionistic “fragment” of the tq-protocol - a cut-elimination procedure for classical logic defined by Danos, Joinet and Schellinx. Moreover we identify the subcalculus of our system which is isomorphic to natural deduction, the isomorphism being with respect not only to proofs but also to normalisation.
Our results show, for the implicational fragment of intuitionistic logic, how to embed natural deduction in the much wider world of sequent calculus and what a particular cut-elimination procedure normalisation is.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Danos, J-B. Joinet, and H. Schellinx. A new deconstructive logic: linear logic. The Journal of Symbolic Logic, 62(2):755–807, 1997.
R. Dyckhoff and L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60:107–118, 1998.
R. Dyckhoff and L. Pinto. Permutability of proofs in intuitionistic sequent calculi. Theoretical Computer Science, 212:141–155, 1999.
J. Espýrito Santo, 2000. PhD Thesis (in preparation).
J. Gallier. Constructive logics. Part I. Theoretical Computer Science, 110:248–339, 1993.
H. Herbelin. A λ-calculus structure isomorphic to a Gentzen-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL’94, volume 933 of Lecture Notes in Computer Science, pages 61–75. Springer-Verlag, 1995.
H. Herbelin. Sequents qu’on calcule, 1995. PhD Thesis, Université Paris VII.
M. Parigot. λμ-calculus: an algorithmic interpretation of classic natural deduction. In Int. Conf. Logic Prog. Automated Reasoning, volume 624 of Lecture Notes in Computer Science. Springer Verlag, 1992.
G. Pottinger. Normalization as a homomorphic image of cut-elimination. Annals of Mathematical Logic, 12:323–357, 1977.
D. Prawitz. Natural Deduction. A Proof-Theoretical Study. Almquist and Wiksell, Stockholm, 1965.
A.M. Ungar. Normalization, Cut-eliminations and the Theory of Proofs. Number 28 in CSLI Lecture Notes. 1992.
C. Urban and G. Bierman. Strong normalisation of cut-elimination in classical logic. In Proceedings of TLCA’99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
R. Vestergaard and J. Wells. Cut rules and explicit substitutions. In Second International Workshop on Explicit Substitutions, 1999.
P. Wadler. A Curry-Howard isomorphism for sequent calculus, 1993. Manuscript.
J. Zucker. The correspondence between cut-elimination and normalization. Annals of Mathematical Logic, 7:1–112, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santo, J.E. (2000). Revisiting the Correspondence between Cut Elimination and Normalisation. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_51
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive