Skip to main content
SpringerLink
Log in

Three faces of natural deduction

  • Invited Lectures
  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1227))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky S. Computational Interpretations of Linear Logic, Theoretical Computer Science 111, 1993, 3–57

    Google Scholar 

  2. Babaev A. Equality of Canonical Maps in Closed Categories. (Russian), Izvestija Azerb. Akad. Nauk, Ser. matem., 1980, N6

    Google Scholar 

  3. N.Benton,G.Bierman,V. de Paiva, M. Hyland, Linear lambda-calculus and Categorical Models Revisited, Springer LNCS 702, 1993, 61–84

    Google Scholar 

  4. H. Barendregt, The Lambda Calculus, Amsterdam, North-Holland, 1981

    Google Scholar 

  5. H.Curry, R. Feys, Craig W. Combinatory Logic, Amsterdam, North-Holland, 1958

    Google Scholar 

  6. G. Gentzen. Untersuchungen über das logische Schliessen. Mathematische Zeitschrift, 39, 1934, 176–210, 405–431

    Google Scholar 

  7. G. Gentzen. Untersuchungen über das logische Schliessen. Mathematische Zeitschrift, 39, 1934, 176–210, 405–431

    Google Scholar 

  8. J.Y. Girard, Y.Lafont, P. Taylor, Proofs and Types, Cambridge University Press, Cambridge 1988

    Google Scholar 

  9. J.-Y. Girard, Linear Logic, Theoretical Computer Science, 1987, 50, 1–102

    Google Scholar 

  10. H. Herbelin, A λ-calculus Structure Isomorphic to Gentzen-style Sequent Structure, CSL 94, 61–75

    Google Scholar 

  11. W.Howard The Formulae-as-types Notion of Construction, in: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, 1980, 479–490

    Google Scholar 

  12. Kleene S.C., Permutability of inferences in Gentzen's Calculi LK and LJ, Memoirs of the AMS, 1952, no 10, p.1–26

    Google Scholar 

  13. G.M. Kelly, S. MacLane, Coherence in Closed Categories, Journal of Pure and Applied Algebra, 1971, 1, 97–140

    Google Scholar 

  14. D.Leivant, Existential instantiation in a system of natural deduction, Mathematish Centrum-ZW 13–73, 1973

    Google Scholar 

  15. P. Lincoln, J. Mitchell, Operational aspects of Linear Lambda Calculus, Proc. IEEE Symp. on Logic in Computer Science, 1992, 235–247

    Google Scholar 

  16. F. Lamarche,Game Semantics for Full Propositional Linear Logic, Proc. IEEE Symp. on Logic in Computer Science, 1995, 464–473

    Google Scholar 

  17. S. Maslov. The connection between tactics of inverse method and the resolution method. A.O.Slisenko (editor). Zapiski Nauchnykh Seminarov LOMI. v. 16, 1969. English translation in: J.Siekmann, G. Wrightson, eds. Automated Reasoning, Springer-Verlag, Berlin, 1983, v2., 264–27

    Google Scholar 

  18. G.Mints. Resolution Calculi for Non-classical Logics (Russian), 9-th Soviet Symposium in Cybernetics, 1981, v.2, 34–36

    Google Scholar 

  19. G.Mints. Resolution Calculi for Non-classical Logics (Russian). Semiotika i Informatika, 25, 1985, 120–135

    Google Scholar 

  20. G.Mints. Gentzen-type Systems and Resolution Rule. Part I. Propositional Logic. Lecture Notes in Computer Sci. 417, 1990, 198–231

    Google Scholar 

  21. G. Mints. Gentzen-type Systems and Resolution Rule. Part II. Logic Colloquium'90, 163–190

    Google Scholar 

  22. G.Mints, Closed Categories and the Theory of Proofs, J.Soviet Mathematics, 1981, 15, 45–62, [27] 183–212 (Russian original 1977)

    Google Scholar 

  23. G.Mints, Normal forms for sequent derivations, Kreiseliana, A. K. Peters, Wellesley, MA, 1996, 469–492

    Google Scholar 

  24. G. Mints, Normal Deduction in the Intuitionistic Linear Logic, CSLI report CSLI-95-50, 1995, to appear in Arcive for Mathematical Logic

    Google Scholar 

  25. G. Mints, On E-theorems, in: [27], 105–116 (Russian original 1974)

    Google Scholar 

  26. G.Mints, Finite Investigations of Transfinite Derivations, J.Soviet Mathematics, 1978, 10, 548–596, [27], p. 17–72 (Russian original 1975)

    Google Scholar 

  27. G. Mints, Selected Papers in Proof Theory, North-Holland-Bibliopolis, 1992

    Google Scholar 

  28. G.Mints, Review of [32], Referativnyi Zhurnal Matematika, 1978, n. 10, 10A26 (Russian)

    Google Scholar 

  29. G. Mints, Linear Lambda-terms and Natural Deduction, to appear in Studia Logica

    Google Scholar 

  30. G. Mints, Existential instantiation and Strong Normalization, to appear

    Google Scholar 

  31. Mints G., Lewis Systems and the System T. In: [27], 221–294 (Russian Original 1974)

    Google Scholar 

  32. H. Pottinger, Normalization as a Homomorphic Image of Cutelimination, Annals of Pure and Applied Logic, 12, 1977, 323–357

    Google Scholar 

  33. Prawitz D., Natural deduction, Almquist and Wiksell, 1965

    Google Scholar 

  34. D.Prawitz, Ideas and Results in Proof Theory, in: Proc. 2-nd Scand.Logic Symp., North-Holland, 1972, 235–308

    Google Scholar 

  35. Quine W., Quine V., On natural deduction, JSL,v.15,1950, 93–102

    Google Scholar 

  36. S. Ronchi della Rocca, L. Roversi, Lambda Calculus and Intuitionistic Linear Logic (manuscript)

    Google Scholar 

  37. H. Schwichtenberg,A. Troelstra, Basic Proof, Theory, Cambridge University Press, 1996

    Google Scholar 

  38. A. Troelstra, D. van Dalen, Constructivism in Mathematics, An Introduction, v.2, 1988, North-Holland

    Google Scholar 

  39. A.Troelstra, Natural Deductions for Intuitionistic Linear Logic, APAL 73, n1, 1995, 79–108

    Google Scholar 

  40. A.Troelstra, Mathematical Investigation of Intuitionistic Arithmetic and Analysis, Springer Lecture Notes in Mathematics v. 344, 1973

    Google Scholar 

  41. S. Valentini, The Judgement Calculus for Intuitionistic Linear Logic: Proof Theory and Semantics, Zeitschrift f. math. Log., 1992, 38, n1, 38–58

    Google Scholar 

  42. J. Zucker, The Correspondence between Cut-elimination and Normalization, Annals of Pure and Applied Logic, 1974, 7, 1–156

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Stanford University, 94305, Stanford, CA, USA

    G. Mints

Authors
  1. G. Mints
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Galmiche

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mints, G. (1997). Three faces of natural deduction. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027402

Download citation

  • DOI: https://doi.org/10.1007/BFb0027402

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62920-7

  • Online ISBN: 978-3-540-69046-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation