Skip to main content
SpringerLink
Log in

Extended Lambek Calculi and First-Order Linear Logic

  • Chapter
Categories and Types in Logic, Language, and Physics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8222))

Abstract

The Syntactic Calculus [27] — often simply called the Lambek calculus, L, — is a beautiful system in many ways: Lambek grammars give a satisfactory syntactic analysis for the (context-free) core of natural language and, in addition, it provides a simple and elegant syntax-semantics interface

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.: Indexed grammars: An extension of context-free grammars. Journal of the ACM 15(4), 647–671 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  2. Andreoli, J.-M.: Logic programming with focussing proofs in linear logic. Journal of Logic and Computation 2(3) (1992)

    Google Scholar 

  3. Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. In: Bar-Hillel, Y. (ed.) Language and Information. Selected Essays on their Theory and Application, pp. 116–150. Addison-Wesley, New York (1964)

    Google Scholar 

  4. Bellin, G., van de Wiele, J.: Empires and kingdoms in MLL. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 249–270. Cambridge University Press (1995)

    Google Scholar 

  5. Bernardi, R., Moortgat, M.: Continuation semantics for symmetric categorial grammar. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 53–71. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Bernardi, R., Moot, R.: Generalized quantifiers in declarative and interrogative sentences. Logic Journal of the IGPL 11(4), 419–434 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boullier, P.: Proposal for a natural language processing syntactic backbone. Technical Report 3342, INRIA, Rocquencourt (1998)

    Google Scholar 

  8. Boullier, P., Sagot, B.: Efficient and robust LFG parsing: SxLfg. In: International Workshop on Parsing Technologies (2005)

    Google Scholar 

  9. Danos, V.: La Logique Linéaire Appliquée à l’étude de Divers Processus de Normalisation (Principalement du λ-Calcul). PhD thesis, University of Paris VII (June 1990)

    Google Scholar 

  10. Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic 28, 181–203 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Došen, K.: A brief survey of frames for the Lambek calculus. Zeitschrift für Mathematische Logic und Grundlagen der Mathematik 38, 179–187 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fadda, M.: Geometry of Grammar: Exercises in Lambek Style. PhD thesis, Universitat Politècnica de Catalunya (2010)

    Google Scholar 

  13. Gazdar, G.: Applicability of indexed grammars to natural languages. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, pp. 69–94. D. Reidel, Dordrecht (1988)

    Chapter  Google Scholar 

  14. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  15. Girard, J.-Y.: Quantifiers in linear logic II. In: Corsi, G., Sambin, G. (eds.) Nuovi Problemi Della Logica e Della Filosofia Della Scienza, Bologna, Italy, vol. II. CLUEB (1991). Proceedings of the conference with the same name, Viareggio, Italy (January 1990)

    Google Scholar 

  16. Girard, J.-Y.: Linear logic: Its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 1–42. Cambridge University Press (1995)

    Google Scholar 

  17. Girard, J.-Y.: Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11, 301–506 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press (1988)

    Google Scholar 

  19. Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM 12(1), 42–52 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  20. Guerrini, S.: Correctness of multiplicative proof nets is linear. In: Fourteenth Annual IEEE Symposium on Logic in Computer Science, pp. 454–263. IEEE Computer Science Society (1999)

    Google Scholar 

  21. Huybregts, R.: The weak inadequacy of context-free phrase structure grammars. In: de Haan, G., Trommelen, M., Zonneveld, W. (eds.) Van Periferie naar Kern. Foris, Dordrecht (1984)

    Google Scholar 

  22. Joshi, A.: Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions. In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Processing: Theoretical, Computational, and Psychological Perspectives. Cambridge University Press (1985)

    Google Scholar 

  23. Kaji, Y., Nakanishi, R., Seki, H., Kasami, T.: The computational complexity of the universal recognition problem for parallel multiple context-free grammars. Computational Intelligence 10(4), 440–452 (1994)

    Article  MathSciNet  Google Scholar 

  24. Kanazawa, M.: The pumping lemma for well-nested multiple context-free languages. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 312–325. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Keller, B., Weir, D.: A tractable extension of linear indexed grammars. In: Proceedings of the Seventh Meeting of the European Chapter of the Association for Computational Linguistics, pp. 75–82 (1995)

    Google Scholar 

  26. Kurtonina, N., Moortgat, M.: Structural control. In: Blackburn, P., de Rijke, M. (eds.) Specifying Syntactic Structures, pp. 75–113. CSLI, Stanford (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  28. Lincoln, P.: Deciding provability of linear logic formulas. In: Girard, Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 109–122. Cambridge University Press (1995)

    Google Scholar 

  29. Lincoln, P., Scedrov, A.: First order linear logic without modalities is NEXPTIME-hard. Theoretical Computer Science 135(1), 139–154 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  30. Matsuzaki, T., Miyao, Y., Tsujii, J.: Efficient HPSG parsing with supertagging and CFG-filtering. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 1671–1676 (2007)

    Google Scholar 

  31. Moortgat, M.: Multimodal linguistic inference. Journal of Logic, Language and Information 5(3-4), 349–385 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  32. Moortgat, M.: Symmetries in natural language syntax and semantics: The Lambek-Grishin calculus. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 264–284. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  33. Moortgat, M.: Typelogical grammar. Stanford Encyclopedia of Philosophy Website (2010), http://plato.stanford.edu/entries/typelogical-grammar/

  34. Moortgat, M.: Categorial type logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, ch. 2, pp. 95–179. Elsevier/MIT Press (2011)

    Google Scholar 

  35. Moortgat, M., Moot, R.: Proof nets for the lambek-grishin calculus. In: Grefenstette, E., Heunen, C., Sadrzadeh, M. (eds.) Compositional Methods in Physics and Linguistics, pp. 283–320. Oxford University Press (2013)

    Google Scholar 

  36. Moot, R.: Proof nets and labeling for categorial grammar logics. Master’s thesis, Utrecht University, Utrecht (1996)

    Google Scholar 

  37. Moot, R.: Proof Nets for Linguistic Analysis. PhD thesis, Utrecht Institute of Linguistics OTS, Utrecht University (2002)

    Google Scholar 

  38. Moot, R.: Filtering axiom links for proof nets. In: Kallmeyer, L., Monachesi, P., Penn, G., Satta, G. (eds.) Proceedings of Formal Grammar 2007 (2007) (to appear with CSLI)

    Google Scholar 

  39. Moot, R.: Lambek grammars, tree adjoining grammars and hyperedge replacement grammars. In: Gardent, C., Sarkar, A. (eds.) Proceedings of TAG+9, The Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 65–72 (2008)

    Google Scholar 

  40. Moot, R., Piazza, M.: Linguistic applications of first order multiplicative linear logic. Journal of Logic, Language and Information 10(2), 211–232 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  41. Moot, R., Puite, Q.: Proof nets for the multimodal Lambek calculus. Studia Logica 71(3), 415–442 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  42. Moot, R., Retoré, C.: The Logic of Categorial Grammars. LNCS, vol. 6850. Springer, Heidelberg (2012)

    MATH  Google Scholar 

  43. Morrill, G.: Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press (2011)

    Google Scholar 

  44. Morrill, G., Fadda, M.: Proof nets for basic discontinuous Lambek calculus. Journal of Logic and Computation 18(2), 239–256 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  45. Morrill, G., Valentín, O.: On calculus of displacement. In: Proceedings of TAG+Related Formalisms. University of Yale (2010)

    Google Scholar 

  46. Morrill, G., Valentín, O., Fadda, M.: The displacement calculus. Journal of Logic, Language and Information 20(1), 1–48 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  47. Murawski, A.S., Ong, C.-H.L.: Dominator trees and fast verification of proof nets. In: Logic in Computer Science, pp. 181–191 (2000)

    Google Scholar 

  48. Nederhof, M.-J., Satta, G.: Theory of parsing. In: Clark, A., Fox, C., Lappin, S. (eds.) The Handbook of Computational Linguistics and Natural Language Processing, pp. 105–130. Wiley-Blackwell (2010)

    Google Scholar 

  49. Pentus, M.: Product-free Lambek calculus and context-free grammars. Journal of Symbolic Logic 62, 648–660 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  50. Pentus, M.: Lambek calculus is NP-complete. Theoretical Computer Science 357(1), 186–201 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  51. Pentus, M.: A polynomial-time algorithm for Lambek grammars of bounded order. Linguistic Analysis 36(1-4), 441–471 (2010)

    Google Scholar 

  52. Pereira, F., Shieber, S.: Prolog and Natural Language Analysis. CSLI, Stanford (1987)

    MATH  Google Scholar 

  53. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88, 191–229 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  54. Shieber, S.: Evidence against the context-freeness of natural language. Linguistics & Philosophy 8, 333–343 (1985)

    Article  Google Scholar 

  55. Sorokin, A.: Normal forms for multiple context-free languages and displacement Lambek grammars. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 319–334. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  56. Stabler, E.: Tupled pregroup grammars. Technical report, University of California, Los Angeles (2003)

    Google Scholar 

  57. Valentín, O.: Theory of Discontinuous Lambek Calculus. PhD thesis, Universitat Autònoma de Catalunya (2012)

    Google Scholar 

  58. Wijnholds, G.: Investigations into categorial grammar: Symmetric pregroup grammar and displacement calculus, Bachelor thesis, Utrecht University (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LaBRI, University of Bordeaux, France

    Richard Moot

Authors
  1. Richard Moot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Philosophy, Education and Quantitative Economics, Gabriele D’Annunzio University, Chieti-Pescara, Via dei Vestini 31, 60100, Chieti, Italy

    Claudia Casadio

  2. Department of Computer Science, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Bob Coecke

  3. Utrecht Institute of Linguistics OTS, Utrecht University, Trans 10,, 3512 JK, Utrecht, The Netherlands

    Michael Moortgat

  4. Department of Mathematics, University of Ottawa, 585 King Edward, K1N 6N5, Ottawa, ON, Canada

    Philip Scott

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Moot, R. (2014). Extended Lambek Calculi and First-Order Linear Logic. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds) Categories and Types in Logic, Language, and Physics. Lecture Notes in Computer Science, vol 8222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54789-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54789-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54788-1

  • Online ISBN: 978-3-642-54789-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation