Strong normalisation of cut-elimination in classical logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1581, Issue , 1999, Pages 365-380

  Urban, C ^a   Bierman, G M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); PATHOLOGY;

CLASSICAL LOGIC; CURRY-HOWARD CORRESPONDENCE; CUT ELIMINATION; CUT-ELIMINATION PROCEDURE; NORMALISATION; REWRITE RULES; SEQUENT CALCULUS; STRONG NORMALIZATION;

COMPUTER CIRCUITS;

EID: 84949210554     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_26     Document Type: Conference Paper

References (20)

1. F. Barbanera and S. Berardi. A Symmetric Lambda Calculus for "Classical" Program Extraction. In Proc. of Theoretical Aspects of Computer Software, volume 789 of LNCS, pages 495-515. Springer Verlag, 1994.
2. H. Barendregt. The Lambda Calculus - Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1981.
3. G. Bierman. Some Lectures on Proof Theory. Notes from course given at PUC-Rio, November 1997.
4. E. T. Bittar. Strong Normalisation Proofs for Cut Elimination in Gentzen’s Sequent Calculi. In Proc. of the Symposium: Logic, Algebra and Computer Science, Warsaw, December 1996.
5. E. A. Cichon, M. Rusinowitch, and S. Selhab. Cut Elimination and Rewriting: Termination Proofs. Theoretical Computer Science, 1996. (to appear).
6. V. Danos, J.-B. Joinet, and H. Schellinx. A New Deconstructive Logic: Linear Logic. Journal of Symbolic Logic, 62 (3):755-807, Sept. 1997.
7. A. G. Dragalin. Mathematical Intuitionism, volume 67. American Mathematical Society, Providence, Rhode Island, 1988.
8. R. Dyckhoff and L. Pinto. Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica, 60:107-118, 1998.
9. J. Gallier. Constructive Logics. Part I: A Tutorial on Proof Systems and Typed λ-Calculi. Theoretical Computer Science, 110 (2):249-239, 1993.
10. G. Gentzen. Untersuchungen über das logische Schließen I and II. Mathematische Zeitschrift, 39:176-210, 405-431, 1935.
11. J.-Y. Girard. Linear Logic. Theoretical Computer Science, 50:1-102, 1987.
12. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
13. E. H. Hauesler and L. C. Pereira. Gentzen’s Second Consistency Proof and Strong Cut-Elimination. Logique and Analyse, 154:95-111, 1996.
14. H. Herbelin. A λ-Calculus Structure Isomorphic to Sequent Calculus Structure. In Proc. of the Conference on Computer Science Logic, volume 933 of LNCS, pages 67-75. Springer Verlag, 1995.
15. tq: Linear Decorations and Simulation of Normalisation. Technical Report, May 1998.
16. S. C. Kleene. Introduction to Metamathematics. North-Holland Publishing Company, Amsterdam, 1952.
17. M. Parigot. λµ-Calculus: An Algorithmic Interpretation of Classical Logic. In Proc. of the Int. Conference on Logic Programming and Automated Deduction, volume 624 of LNCS, pages 190-201. Springer Verlag, 1992.
18. A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996.
19. C. Urban. First-Year Report: Computational Content of Classical Proofs. Technical Report, 1997.
20. J. Zucker. The Correspondance Between Cut-Elimination and Normalisation. Annals of Mathematical Logic, 7:1-112, 1974.