Skip to main content
SpringerLink
Log in
Book cover

Categories and Types in Logic, Language, and Physics pp 393–401Cite as

Conjoinability in 1-Discontinuous Lambek Calculus

  • Chapter

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

Abstract

In the present work we prove a conjoinability criterion for 1-discontinuous Lambek calculus. It turns out that types of this calculus are conjoinable if and only if they have the same sort and the same interpretation in the free abelian group generated by the primitive types.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foret, A.: Conjoinability and unification in Lambek categorial grammars. In: New Perspectives in Logic and Formal Linguistics, Proceedings Vth ROMA Workshop, Bulzoni, Roma (2001)

    Google Scholar 

  2. Moortgat, M., Pentus, M.: Type similarity for the Lambek-Grishin calculus. In: Proceedings of the 12th Conference on Formal Grammar, Dublin (2007)

    Google Scholar 

  3. Morrill, G., Valentín, O.: On calculus of displacement. In: Proceedings of the 10th International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 45–52 (2010)

    Google Scholar 

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

  5. Pentus, M.: The conjoinability relation in Lambek calculus and linear logic. ILLC Prepublication Series ML-93-03. Institute for Logic, Language and Computation, University of Amsterdam (1993)

    Google Scholar 

  6. Pentus, M.: Lambek grammars are context-free. In: Logic in Computer Science, Proceedings of the LICS 1993, pp. 429–433 (1993)

    Google Scholar 

  7. Valentín, O.: 1-discontinuous Lambek calculus: Type logical grammar and discontinuity in natural language. Master’s thesis. Universitat Autònoma de Barcelona (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow Institute of Physics and Technology, Moscow State University, Russia

    Alexey Sorokin

Authors
  1. Alexey Sorokin
    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

Sorokin, A. (2014). Conjoinability in 1-Discontinuous Lambek Calculus. 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_22

Download citation

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

  • 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