Skip to main content

Relational Models of Lambek Logics

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2929))

Abstract

Lambek logics are substructural logics related to the Syntactic Calculus of Lambek [17]. In this paper we prove several representation theorems for algebras of Lambek logics (residuated semigroups, residuated monoids and others) with respect to certain algebras of binary relations. First results of this kind were obtained by Andréka and Mikulás [1], using a method of labeled graphs. Other results were proved in [9,28], using a method of labeled formulas. In the present paper, we prove these and other results, using a construction of chains of partial representations; this idea was announced earlier in the abstract [5]. We also provide a simpler construction which works for right and left pregroups [8].

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andréka, H., Mikulás, S.: Lambek Calculus and Its Relational Semantics. Completeness and Incompleteness. Journal of Logic, Language and Information 3(1), 1–37 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. van Benthem, J.: Language in Action. Categories, Lambdas and Dynamic Logic. North Holland, Amsterdam (1991)

    MATH  Google Scholar 

  3. Buszkowski, W.: Completeness Results for Lambek Syntactic Calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 32, 13–28 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Buszkowski, W.: Algebraic Structures in Categorial Grammar. Theoretical Computer Science 199, 1–24 (1998)

    Article  MathSciNet  Google Scholar 

  5. Buszkowski, W.: More on embeddings of residuated semigroups into algebras of relations (abstract). In: Orłowska, E., Szałas, A. (eds.) Relational Methods in Logic, Algebra and Computer Science, Warsaw, pp. 33–36 (1998)

    Google Scholar 

  6. Buszkowski, W.: Finite Models of Some Substructural Logics. Mathematical Logic Quarterly 48, 63–72 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Buszkowski, W.: Lambek Grammars Based on Pregroups. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 95–109. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Buszkowski, W.: Pregroups: Models and Grammars. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 35–49. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Buszkowski, W., Kołowska-Gawiejnowicz, M.: Representation of Residuated Semigroups in Some Algebras of Relations (The Method of Canonical Models). Fundamenta Informaticae 31, 1–12 (1997)

    MATH  MathSciNet  Google Scholar 

  10. Dunn, J.M.: Partial gaggles applied to logics with restricted structural rules. In: [13], pp. 63–108

    Google Scholar 

  11. Došen, K.: Sequent Systems and Groupoid Models. Studia Logica 47, 353–386 (1988), 48, 41–65 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Došen, K.: A Brief Survey of Frames for The Lambek Calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 38, 179–187 (1992)

    Article  MATH  Google Scholar 

  13. Došen, K., Schroeder-Heister, P. (eds.): Substructural Logics. Oxford University Press, Oxford (1993)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Hoare, C.A.R., Jifeng, H.: The weakest prespecification. Fundamenta Informaticae 9, 51–84, 217–262 (1986)

    MATH  MathSciNet  Google Scholar 

  16. Kurtonina, N.: Frames and Labels. A Modal Analysis of Categorial Inference. Ph.D. Thesis, University of Utrecht (1995)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (ed.) Structure of Language and Its Mathematical Aspects, pp. 166–178. AMS, Providence (1961)

    Google Scholar 

  19. 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 

  20. MacCaull, W., Orłowska, E.: Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus. Studia Logica 71, 389–414 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Moortgat, M.: Categorial Type Logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 93–177. Elsevier, Amsterdam (1997)

    Chapter  Google Scholar 

  22. Ono, H.: Semantics for Substructural Logics. In: [13], pp. 259–291

    Google Scholar 

  23. Orłowska, E.: Relational Interpretation of Modal Logics. In: Andréka, H., Monk, D., Nemeti, I. (eds.) Algebraic Logic, pp. 443–471. North Holland, Amsterdam (1988)

    Google Scholar 

  24. Orłowska, E.: Relational proof system for relevant logic. Journal of Symbolic Logic 57, 1425–1440 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  25. Pentus, M.: Models for The Lambek Calculus. Annals of Pure and Applied Logic 75, 179–213 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  26. Pratt, V.: Action Logic and Pure Induction. In: van Eijck, J. (ed.) JELIA 1990. LNCS (LNAI), vol. 478, pp. 97–120. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  27. Restall, G.: An Introduction to Substructural Logics. Routledge, London (2000)

    Google Scholar 

  28. Szczerba, M.: Relational Models for The Nonassociative Lambek Calculus. In: Orłowska, E., Szałas, A. (eds.) Relational Methods for Computer Science Applications, pp. 149–159. Physica Verlag, Heidelberg (2001)

    Google Scholar 

  29. Venema, Y.: Tree models and (labelled) categorial grammars. Journal of Logic, Language and Information 5, 253–277 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  30. Yetter, D.N.: Quantales and (non-commutative) linear logic. Journal of Symbolic Logic 55, 41–64 (1996)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Buszkowski, W. (2003). Relational Models of Lambek Logics. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds) Theory and Applications of Relational Structures as Knowledge Instruments. Lecture Notes in Computer Science, vol 2929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24615-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24615-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20780-1

  • Online ISBN: 978-3-540-24615-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics