Abstract
Powerful proof techniques, such as logical relation arguments, have been developed for establishing the strong normalisation property of term- rewriting systems. The first author used such a logical relation argument to establish strong normalising for a cut-elimination procedure in classical logic. He presented a rather complicated, but informal, proof establishing this property. The difficulties in this proof arise from a quite subtle substitution operation, which implements proof transformation that permute cuts over other inference rules. We have formalised this proof in the theorem prover Isabelle/HOL using the Nominal Datatype Package, closely following the informal proof given by the first author in his PhD-thesis. In the process, we identified and resolved a gap in one central lemma and a number of smaller problems in others. We also needed to make one informal definition rigorous. We thus show that the original proof is indeed a proof and that present automated proving technology is adequate for formalising such difficult proofs.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aydemir, B., Charguéraud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering Formal Metatheory. In: Proc. of the 35rd Symposium on Principles of Programming Languages (POPL), pp. 3–15. ACM, New York (2008)
Barbanera, F., Berardi, S.: A Symmetric Lambda Calculus for “Classical” Program Extraction. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 495–515. Springer, Heidelberg (1994)
Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1981)
Brauner, P., Houtmann, C., Kirchner, C.: Principles of Superdeduction. In: Proc. of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 41–50 (2007)
Gentzen, G.: Untersuchungen über das logische Schließen I and II. Mathematische Zeitschrift 39, 176–210, 405–431 (1935)
Harper, R., Pfenning, F.: On Equivalence and Canonical Forms in the LF Type Theory. ACM Transactions on Computational Logic 6(1), 61–101 (2005)
Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)
Kleene, S.C.: Disjunction and Existence Under Implication in Elementary Intuitionistic Formalisms. Journal of Symbolic Logic 27(1), 11–18 (1962)
Pfenning, F.: Structural Cut Elimination. Information and Computation 157(1–2), 84–141 (2000)
Pitts, A.: Alpha-Structural Recursion and Induction. Journal of the ACM 53, 459–506 (2006)
Prawitz, D.: Ideas and Results of Proof Theory. In: Proceedings of the 2nd Scandinavian Logic Symposium. Studies in Logic and the Foundations of Mathematics, vol. 63, pp. 235–307. North-Holland, Amsterdam (1971)
Schürmann, C., Sarnat, J.: Towards a Judgemental Reconstruction of Logical Relation Proofs. In: Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS) (to appear, 2008)
Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol. 43. Cambridge University Press, Cambridge (1996)
Urban, C.: Classical Logic and Computation. PhD thesis, Cambridge University (October 2000)
Urban, C., Berghofer, S.: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 498–512. Springer, Heidelberg (2006)
Urban, C., Berghofer, S., Norrish, M.: Barendregt’s Variable Convention in Rule Inductions. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 35–50. Springer, Heidelberg (2007)
Urban, C., Bierman, G.: Strong Normalisation of Cut-Elimination in Classical Logic. Fundamenta Informaticae 45(1–2), 123–155 (2001)
Urban, C., Cheney, J., Berghofer, S.: Mechanizing the Metatheory of LF. In: Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS). Technical report (to appear, 2008), http://isabelle.in.tum.de/nominal/LF
Urban, C., Tasson, C.: Nominal Techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 38–53. Springer, Heidelberg (2005)
van Bakel, S., Lengrand, S., Lescanne, P.: The Language X: Circuits, Computations and Classical Logic. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 81–96. Springer, Heidelberg (2005)
Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the π-Calculus. In: Proc. of the 16th IEEE Symposium on Logic in Computer Science (LICS), pp. 311–322 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urban, C., Zhu, B. (2008). Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof. In: Voronkov, A. (eds) Rewriting Techniques and Applications. RTA 2008. Lecture Notes in Computer Science, vol 5117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70590-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-70590-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70588-8
Online ISBN: 978-3-540-70590-1
eBook Packages: Computer ScienceComputer Science (R0)