Abstract
We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cut-elimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams, A. A., 'Meta-theory of sequent calculus and natural deduction systems in Coq', in preparation (St Andrews University).
Andreoli, J.-M., 'Logic programming with focusing proofs in linear logic', Journal of Logic and Computation 2 (1992), 297-347.
Cichon, E. A., M. Rusinowitch and S. Selhab, 'Cut elimination and rewriting: termination proofs', in preparation (preprint received in June 1996), INRIA-Lorraine, Nancy, France.
Cittadini, S., 'Intercalation calculus for intuitionistic propositional logic', Report 29 in Philosophy, Methodology, Logic Series, Carnegie Mellon University (1992).
ČubriĊ, D., 'Interpolation property for bicartesian closed categories', Arch. Math. Logic 33 (1994), 291-319.
Danos, V., J. B. Joinet and H. Schellinx, 'LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication', in Advances in Linear Logic (Proceedings of the Cornell Workshop on Linear Logic, edited by J.-Y. Girard, Y. Lafont and L. Regnier), Cambridge University Press (1995), 211-224.
Dershowitz, N., 'Orderings for term-rewriting systems', Theoretical Computer Science 17 (1982), 279-301.
Dragalin, A., Mathematical intuitionism — Introduction to proof theory, AMS Translations of Mathematical Monographs 67 (1988).
Dyckhoff, R., 'Contraction-free sequent calculi for intuitionistic logic', Journal of Symbolic Logic 57 (1992), 795-807.
Dyckhoff, R., and L. Pinto, 'Uniform proofs and natural deductions', in Proceedings of CADE-12 workshop on “Proof search in type theoretic languages” (edited by D. Galmiche & L. Wallen), Nancy, June 1994.
Dyckhoff, R., and L. Pinto, 'A permutation-free sequent calculus for intuitionistic logic', St Andrews University Computer Science Research Report CS/96/9 (August 1996).; revised version from http://www-theory.dcs.st-and.ac.uk/~rd/.
Dyckhoff, R., and L. Pinto: 'Permutability of proofs in intuitionistic sequent calculi', submitted (1996) for publication; abstract appeared in Proceedings of 10th International Congress on Logic, Methodology and Philosophy of Science, held at Florence (1995).
Gentzen, G., The Collected Papers of Gerhard Gentzen, (M. Szabo, editor), North-Holland, Amsterdam 1969.
Girard, J.-Y., 'A new constructive logic: classical logic', Mathematical Structures in Computer Science 1 (1991), 255-196.
Girard, J.-Y., A. Scedrov and P. Scott, 'Normal forms and cut-free proofs as natural transformations', in Logic from Computer Science, MSRI publications, Y. Moschovakis (editor), 21, Springer-Verlag, 1992, 217-241.
Herbelin, H., 'A λ-calculus structure isomorphic to sequent calculus structure', preprint, (October 1994); now available at http://capella.ibp.fr/~herbelin/LAMBDA-BAR-FULL.dvi.gz.
Herbelin, H., 'A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure', in Proceedings of the 1994 Conference on Computer Science Logic, Kazimierz (Poland), (edited by L. Pacholski and J. Tiuryn), Springer Lecture Notes in Computer Science 933 (1995), 61-75.
Howard, W. A., 'The formulae-as-types notion of construction', in To H. B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, (edited by J. R. Hindley and J. P. Seldin), Academic Press (1980).
Kleene, S. C., 'Permutability of inferences in Gentzen's calculi LK and LJ', Mem. Amer. Math. Soc. (1952), 1-26.
Leivant, D., 'Assumption classes in natural deduction', Zeitschrift für math. Logik 25 (1979), 1-4.
Miller, D., 'Forum: a multiple-conclusion specification logic', Theoretical Computer Science 165 (1996), 201-232.
Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, 'Uniform proofs as a foundation for logic programming', Annals of Pure and Applied Logic 51 (1991), 125-157.
Pfenning, F., Notes on Deductive Systems, Carnegie Mellon University, (June 1994).
Prawitz, D., Natural Deduction, Almquist & Wiksell, Stockholm (1965).
Sieg, W., 'Mechanisms and search', AILA preprint 14 (1992).
Tahhan Bittar, E., 'Gentzen cut elimination for propositional sequent calculus by rewriting derivations', Pub. du Laboratoire de Logique, d'Algorithmique et d'Informatique de Clermont 1, Université d'Auvergne, 16 (1992).
Tahhan Bittar, E., 'Strong normalisation proofs for cut elimination in Gentzen's sequent calculi', Prépub. du Laboratoire de Logique, d'Algorithmique et d'Informatique de Clermont 1, Université d'Auvergne, 56 (1996).
Troelstra, A. S., and D. van Dalen, Constructivism in Mathematics: An Introduction (vol 2), North Holland, 1988.
Troelstra, A. S., and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dyckhoff, R., Pinto, L. Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica 60, 107–118 (1998). https://doi.org/10.1023/A:1005099619660
Issue Date:
DOI: https://doi.org/10.1023/A:1005099619660