Skip to main content

On Associative Lambek Calculus Extended with Basic Proper Axioms

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

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

  • 1062 Accesses

Abstract

The purpose of this article is to show that the associative Lambek calculus extended with basic proper axioms can be simulated by the usual associative Lambek calculus, with the same number of types per word in a grammar. An analogue result had been shown for pregroups grammars [1]. We consider Lambek calculus with product, as well as the product-free version.

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

Access this chapter

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. Béchet, D., Foret, A.: Fully lexicalized pregroup grammars. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 12–25. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Buszkowski, W.: Some decision problems in the theory of syntactic categories. Zeitschrift f. Math. Logik u. Grundlagen der Mathematik 28, 539–548 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Buszkowski, W.: Mathematical linguistics and proof theory. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, ch. 12, pp. 683–736. North-Holland Elsevier, Amsterdam (1997)

    Google Scholar 

  4. Buszkowski, W.: Type Logics in Grammar. Trends in logic. Studia Logica Library, vol. 21, pp. 321–366. Springer (2003)

    Google Scholar 

  5. Buszkowski, W.: Lambek calculus with nonlogical axioms. In: Language and Grammar, Studies in Mathematical Linguistics and Natural Language, pp. 77–93. CSLI Publications (2005)

    Google Scholar 

  6. Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65 (1958)

    Google Scholar 

  7. Lambek, J.: Type grammars revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, pp. 1–27. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Moot, R., Retoré, C.: The Logic of Categorial Grammars. LNCS, vol. 6850, pp. 23–63. Springer, Heidelberg (2012)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Foret, A. (2014). On Associative Lambek Calculus Extended with Basic Proper Axioms. 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_10

Download citation

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

  • 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