Abstract
This paper shows how a symmetric and non-deterministic cut elimination procedure for a classical sequent calculus can be faithfully simulated using a non-deterministic choice operator to combine different ‘double-negation’ translations of each cut. The resulting interpretation of classical proofs in a λ-calculus with non-deterministic choice leads to a simple proof of termination for cut elimination.
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
S. Abramsky, R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59:543–574, 1994.
F. Barbanera, and S. Berardi. A symmetric lambda calculus for classical program extraction. Information and Computation, 125:103–117, 1996.
H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics, revised edition. North-Holland, 1984.
A. Blass. A game semantics for linear logic. Annals of Pure and Applied logic, 56:183–220, 1992.
T. Coquand. A semantics of evidence for classical arithmetic. Journal of Symbolic Logic, 60:325–337, 1995.
T. Coquand. Computational content of classical logic. In A. Pitts and P. Dybjer, editor, Semantics and Logics of Computation. Cambridge University Press, 1997.
V. Danos, J.-B. Joinet and H. Schellinx. A new deconstructive logic, linear logic. Journal of Symbolic Logic, 62(3), 1996.
G. Gentzen. Unterschungen über das logische Schlieén I and II. Mathematische Zeitschrift, 39:176–210, 405–431, 1935.
J.-Y. Girard. Towards a geometry of interaction. In Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics, 1989.
J.-Y. Girard. A new constructive logic: classical logic. Mathematical structures in Computer Science, 1:259–256, 1991.
J.-Y. Girard. On the unity of logic. Annals of Pure and Applied Logic, 59:201–217, 1993.
J.-Y. Girard, P. Taylor and Y. Lafont. Proofs and Types. Cambridge University Press, 1990.
K. Gödel. On intuitionistic arithmetic and number theory. In M. Davis, editor, The undecidable, pages 75–81. Raven Press, 1965.
T. Griffin. A formulae-as-types notion of control. In Proc. ACM Conference on the Principles of Programming Languages, pages 47–58. ACM Press, 1990.
M. Hennessey, and E. Ashcroft. Parameter passing and non-determinism. In Conference report of the ninth ACM Conference on Theory of Computing, pages 306–311, 1977.
M. Parigot. λμ calculus: an algorithmic interpretation of classical natural deduction. In Proc. International Conference on Logic Programming and Automated Reasoning, pages 190–201. Springer, 1992.
C. Urban, and G. Bierman. Strong normalisation of cut-elimination in classical logic. In Proceedings of TLCA `99, number 1581 in LNCS, pages 356–380. Springer, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laird, J. (2001). A Deconstruction of Non-deterministic Classical Cut Elimination. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-45413-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41960-0
Online ISBN: 978-3-540-45413-7
eBook Packages: Springer Book Archive