A permutation-free sequent calculus for intuitionistic logic

References (39)

1. Adams, A. A.: "Meta-theory of sequent calculus and natural deduction systems in Coq", in preparation (St Andrews University).
2. Andreoli, J.-M.: "Logic programming with focusing proofs in linear logic", Journal of Logic and Computation, 2 (1992), 297-347.
3. Brock, S.: "Compile-time pointer reversal", from shb@sys.uea.ac.uk.
4. 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.
5. Cittadini, S.: "Intercalation calculus for intuitionistic propositional logic", Report 29 in Philosophy, Methodology, Logic Series, Carnegie Mellon University (1992)..
6. Cubric, D.: "Interpolation property for bicartesian closed categories", Arch. Math. Logic 33 (1994), 291-319.
7. 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), pp 211-224.
8. Dershowitz, N.: "Orderings for term-rewriting systems", Theoretical Computer Science 17 (1982), 279-301.
9. Dyckhoff, R.: "Contraction-free sequent calculi for intuitionistic logic", Journal of Symbolic Logic 57 (1992), 795-807.
10. Dyckhoff, R. and J. Howe: "Proof search in a permutation-free intuitionistic sequent calculus", in preparation, St Andrews University, (1996).
11. Dyckhoff, R. & 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).
12. Dyckhoff, R. & L. Pinto: "Permutability of proofs in intuitionistic sequent calculi," in preparation; abstract appeared in proceedings of 10th International Congress on Logic, Methdology and Philosophy of Science, held at Florence (1995).
13. Gallier, J.: "Constructive logics. Part I: a tutorial on proof systems and typed lambda-calculi", Theoretical Computer Science 110 (1993), 249-339.
14. Galmiche, D. & G. Perrier: "On proof normalization in linear logic", Theoretical Computer Science 135 (1994), 67-110.
15. Gentzen, G.: "The collected papers of Gerhard Gentzen", (M. Szabo, editor), North-Holland, Amsterdam (1969).
16. Girard, J.-Y., Y. Lafont & P. Taylor: "Proofs and types", Cambridge University Press (1989).
17. Girard, J.-Y.: "On the unity of logic", Annals of Pureand Applied Logic 59 (1993), 201-217.
18. Girard, J.-Y.,: "A new constructive logic: classical logic", Mathematical Structures in Computer Science 1 (1991), 255-196.
19. Girard, J.-Y., A. Scedrov & 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.
20. 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".
21. Herbelin, H.: "A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure", Proceedings of the 1994 conference on Computer Science Logic, Kazimierz (Poland), (edited by L. Pacholski & J. Tiuryn), Springer Lecture Notes in Computer Science 933 (1995), 61-75.
22. 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 & J.P. Seldin), Academic Press (1980).
23. Kapur, D. (editor): "Automated deduction", CADE-11 (proceedings) Saratoga Springs 1992, Lecture Notes in Artificial Intelligence 607, Springer-Verlag (1992).
24. Kleene, S. C.: "Permutability of inferences in Gentzen's calculi LK and LJ", Mem. Amer. Math. Soc. (1952), 1-26.
25. Kleene, S. C.: "Introduction to metamathematics", Walters-Noordhoff & North-Holland (1991).
26. Leivant, D.: "Assumption classes in natural deduction", Zeitschrift für math. Logik 25 (1979), 1-4.
27. Miller, D., G. Nadathur, F. Pfenning & A. Scedrov : "Uniform proofs as a foundation for logic programming", Annals of Pure and Applied Logic 51 (1991), 125-157.
28. Miller, D.: "Forum: a multiple-conclusion specification logic", to appear in Theoretical Computer Science.
29. Mints, G.: "Cut-elimination and normal forms of sequent derivations", Report CSLI-94-193, November (1994), Stanford University.
30. Pfenning, F.: "Notes on deductive systems", Carnegie Mellon University, (1994).
31. Pottinger, G.: "Normalization as a homomorphic image of cut-elimination", Annals of Mathematical Logic 12 (1977), 323-357.
32. Prawitz, D.: "Natural deduction", Almquist & Wiksell, Stockholm (1965).
33. Prawitz, D.: "Ideas and results in proof theory", Second Scandinavian Logic Symposium (ed. Fenstad), North-Holland (1970), 235-308.
34. Shankar, N.: "Proof search in the intuitionistic sequent calculus", in [23], 522-536.
35. Sieg, W.: "Mechanisms and Search", AILA Preprint, (1992).
36. 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).
37. Troelstra, A. S., and D. van Dalen: "Constructivism in mathematics: an introduction (vol 2)", North Holland, (1988).
38. Ungar, A. M.: "Normalization, cut-elimination and the theory of proofs", CSLI lecture notes 28, University of Chicago Press (1992).
39. Zucker, J.: "The correspondence between cut-elimination and normalization", Annals of Mathematical Logic 7 (1974), 1-112.