Skip to main content
SpringerLink
Log in

Classical Lambek logic

  • Linear Logic
  • Conference paper
  • First Online:
Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 1995)

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

Abstract

We discuss different options for two-sided sequent systems of noncommutative linear logic and prove a restricted form of cut elimination.

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. Abrusci, V.M. Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic. Journal of Symbolic Logic, 56 (1991), 1403–1451.

    Google Scholar 

  2. Gentzen, G. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39 (1935), 176–210, 405–431, English translation in: M.E. Szabo (ed.), The Collected Papers of Gerhard Gentzen, Amsterdam: North Holland 1969, 68–131.

    Article  Google Scholar 

  3. Girard, J.-Y. Proof Theory and Logical Complexity, Vol. 1, Napoli: Bibliopolis, 1987.

    Google Scholar 

  4. Lambek, J. The mathematics of sentence structure. American Mathematical Monthly, 65 (1958), 154–170.

    Google Scholar 

  5. Lambek, J. Multicategories revisited. Contemporary Mathematics, 92 (1989), 217–339.

    Google Scholar 

  6. Lambek, J. From categorial grammar to bilinear logic. In: Došen, K. & Schroeder-Heister, P. (Eds.) Substructural Logics. Oxford: Clarendon Press, 1993, 207–237.

    Google Scholar 

  7. Lambek, J. Cut elimination for classical bilinear logic. Fundamenta Informaticae, 22 (1995), 53–67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Jörg Hudelmaier & Peter Schroeder-Heister

Authors
  1. Jörg Hudelmaier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Schroeder-Heister
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Baumgartner Reiner Hähnle Joachim Possega

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hudelmaier, J., Schroeder-Heister, P. (1995). Classical Lambek logic. In: Baumgartner, P., Hähnle, R., Possega, J. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1995. Lecture Notes in Computer Science, vol 918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59338-1_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-59338-1_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59338-6

  • Online ISBN: 978-3-540-49235-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation