C. Urban, G.M. Bierman  Home/Search
Context Related
Links: ACM DBLP | cl.cam.ac.uk/users/gmb/Publ...tlca99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cl.cam.ac.uk/users/gmb/Publica... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In this paper a strongly normalising cut-elimination procedure is presented for classical logic. The procedure adapts the standard cut transformations, see for example [12]. In particular our cutelimination procedure requires no special annotations on formulae. We design a term calculus for a variant of Kleene's sequent calculus G3 via the Curry-Howard correspondence and the cut-elimination steps are given as rewrite rules. In the strong normalisation proof we adapt the symmetric reducibility ... (Update)
Context of citations to this paper: More
...cut elimination can be done along the lines of this paper for the full system of intuitionistic predicate logic, but there seems to be no problem. More interesting is the question, whether there are similar results for classical and linear logic. See Urban and Bierman [1999]...
.... some proof theoretic content because only a limited selection of the possible cut elimination behaviours can be pre determined (see [2, 17] and the discussion in Section 1.2 below) On the other hand, more general symmetric and non deterministic cut elimination and...
Cited by: More
On Generalized Theorems for . . . - Aiguier, Boin, Longuet (Correct)
Strong Normalisation of Cut-Elimination in Classical Logic - Urban, Bierman (2000) (Correct)
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (Correct)
Active bibliography (related documents): More All
0.6: Cut Rules and Explicit Substitutions - Vestergaard, Wells (1999) (Correct)
0.2: Cut-Elimination and a Permutation-Free Sequent Calculus for.. - Roy Dyckhoff Luis (1998) (Correct)
0.2: Computational Isomorphisms in Classical Logic - Danos, Joinet, Schellinx (1996) (Correct)
Similar documents based on text: More All
0.3: Iota: A concurrent XML scripting language with applications.. - Bierman, Sewell (2003) (Correct)
0.3: Finitary reductions for local predicativity, I: recursively.. - Tupailo (Correct)
0.2: Cut-Elimination and Redundancy-Elimination by Resolution - Baaz, Leitsch (1999) (Correct)
Related documents from co-citation: More All
2: A formulae-as-types notion of control - Griffin - 1990
2: Introduction to metamathematics (context) - Kleene - 1991
2: Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
BibTeX entry: (Update)
Urban, C. and G. Bierman [1999]. Strong normalisation of cut-elimination in classical logic, in: J.-Y. Girard (ed.), Typed Lambda Calculus and Applications, Lecture Notes in Computer Science 1581, Springer Verlag, Berlin, pp. 365-380. http://citeseer.ist.psu.edu/article/urban99strong.html More
@inproceedings{ urban99strong,
author = "C. Urban and G. M. Bierman",
title = "Strong Normalisation of Cut-Elimination in Classical Logic",
booktitle = "Typed Lambda Calculus and Applications",
pages = "365-380",
year = "1999",
url = "citeseer.ist.psu.edu/article/urban99strong.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987 ACM
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
343 Introduction to Metamathematics (context) - Kleene - 1952
134 calculus: An Algorithmic Interpretation of Classical Logic (context) - Parigot
83 volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
57 A New Deconstructive Logic: Linear Logic - Danos, Joinet et al. - 1997 DBLP
32 The Correspondence Between Cut-Elimination and Normalisation (context) - Zucker - 1974
26 volume 43 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Troelstra, Schwichtenberg et al. - 1996
23 Mathematical Intuitionism: Introduction to Proof Theory (context) - Dragalin - 1988
18 calculus Structure Isomorphic to Sequent Calculus Structure (context) - Herbelin - 1995
11 Cut-Elimination and a Permutation-Free Sequent Calculus for .. - Dyckho, Pinto - 1998 DBLP
9 Strong Normalisation Proofs for Cut-Elimination in Gentzen's.. - Bittar - 1999
7 Cut-Elimination and Rewriting: Termination Proofs (context) - Cichon, Rusinowitch et al. - 1996
4 SN and CR for Free-Style LK tq : Linear Decorations and Simu.. (context) - Joinet, Schellinx et al. - 1998
2 Part I: A Tutorial on Proof Systems and Typed -calculi (context) - Gallier - 1993
1 uber das logische Schlieen I and II (context) - Gentzen - 1935
1 Notes from course given at PUC-Rio (context) - Bierman, on - 1997
1 A Symmetric Lambda Calculus for \Classical (context) - Barbanera, Berardi - 1994
1 First-Year Report: Computational Content of Classical Proofs (context) - Urban - 1997
1 Gentzen's Second Consistency Proof and Strong Cut-Eliminatio.. (context) - Hauesler, Pereira - 1996
Documents on the same site (http://www.cl.cam.ac.uk/users/gmb/Publications/): More
Multiple Modalities - Bierman (1998) (Correct)
A Computational Interpretation of the λμ-calculus - Bierman (1998) (Correct)
A Computational Interpretation of the λμ-calculus - Bierman (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC