Skip to main content

Dyadic Modalities and Lambek Calculus

  • Chapter

Part of the book series: Synthese Library ((SYLI,volume 229))

Abstract

The Lambek calculus is a logic on the one hand, and a grammar on the other. The system is studied in different disciplines, having their own interests. The logician studies relations with other systems, models in general, cut elimination etc. The linguist is interested in parsing properties, expressive power, and models that are useful for (natural) language interpretation. The latter group of questions is less basic; some of them presuppose answers to the logical questions. But there is a converse direction: the linguist may redirect the eye of the logician into other aspects of the formal sytems he deals with. For example, where a logician is content with decidability, the linguist would like to know the complexity, or any measure of feasibility that indicates how useful the proposed systems are for the purposes he has in mind.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bar-Hillel, Y. (1964). On categorial phrase structure grammars. In Language and Information. Selected essays on their theory and application, pp. 99–115, London. Addison-Wesley.

    Google Scholar 

  2. van Benthem, J. (1988). The Lambek calculus. In Oehrle, R. T., Bach, E., and Wheeler, D., editors, Categorial Grammars and Natural Language Structures, pp. 35–68, Dordrecht. Reidel Publishing Company.

    Chapter  Google Scholar 

  3. Buszkowski, W. (1986). Completeness results for Lambek syntactic calculus. Zeitschrift für mathematischen Logik und Grundlagen der Mathematik, 32, pp. 13–28.

    Article  Google Scholar 

  4. Dosen, K. (1985). A completeness theorem for the Lambek calculus of syntactic categories. Zeitschrift für mathematischen Logik und Grundlagen der Mathematik, 31, pp. 235–241.

    Article  Google Scholar 

  5. Dogen, K. (1988). Sequent-systems and groupoid models. I. Studia Logica, XLVII, pp. 353–385.

    Google Scholar 

  6. Dogen, K. (1990). A brief survey of frames for the Lambek calculus. Technical report, Universität Konstanz, Konstanz Bericht 5–90. To appear in Zeitschrift für mathematischen Logik und Grundlagen der Mathematik.

    Google Scholar 

  7. Dunn, J. (1986). Relevance logic and entailment. In Gabbay, D. and Günther, F., editors, Handbook of Philosophical Logic III, pp. 117–224, Dordrecht. Reidel Publishing Company.

    Chapter  Google Scholar 

  8. Gabbay, D. M. (1991). Labelled deductive systems. Draft, to appear.

    Google Scholar 

  9. Gentzen, G. (1943). Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie. Mathematische Annalen, 119, pp. 140–161.

    Article  Google Scholar 

  10. Goranko, V. (1990). Modal definability in enriched languages. Notre Dame Journal of Formal Logic, 31, pp. 81–105.

    Article  Google Scholar 

  11. Hughes, G. and Cresswell, M. (1984). A Companion to Modal Logic. Methuen & Co., Ltd, London, New York.

    Google Scholar 

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

    Google Scholar 

  13. Moortgat, M. (1992). Labelled deductive systems for categorial theorem proving. Technical report, Onderzoeksinstituut voor taal en spraak, Trans 10, 3512 JK Utrecht. OTS-WPCL-92–003.

    Google Scholar 

  14. Morrill, G. (1990). Grammar and logical types. In Barry, G. and Morrill, G., editors, Studies in Categorial Grammar, pp. 127–148, Centre for Cognitive Science, Edinburgh. Working papers, Vol. 5.

    Google Scholar 

  15. Roorda, D. (1991) Resource Logics: proof-theoretical investigations. PhD thesis, Fac. Math. and Comp. Sc., University of Amsterdam.

    Google Scholar 

  16. Roorda, D. (1992). Lambek calculus and Boolean connectives: on the road. Technical report, Research Institute for Language and Speech, Fac. Letteren, Rijksuniversiteit Utrecht. OTSWP-CL-92–004.

    Google Scholar 

  17. de Rijke, M. (1992). The modal logic of inequality. Journal of Symbolic Logic, 57, pp. 566–584.

    Article  Google Scholar 

  18. Sahlqvist, H. (1975). Completeness and correspondence in the first and second order semantics for modal logic. In Kanger, S., editor, Proceedings of the third Scandinavian Logic Symposium, pp. 110-143, Amsterdam. North-Holland Publishing Company.

    Google Scholar 

  19. Venema, Y. (1991). Many dimensional Modal Logic. PhD thesis, Fac. Math. and Comp. Sc., University of Amsterdam.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Roorda, D. (1993). Dyadic Modalities and Lambek Calculus. In: de Rijke, M. (eds) Diamonds and Defaults. Synthese Library, vol 229. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8242-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8242-1_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4286-6

  • Online ISBN: 978-94-015-8242-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics