Skip to main content
SpringerLink
Log in

On the Selective Lambek Calculus

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3492))

  • 450 Accesses

Abstract

An intermediate logical system in comparison with the non-associative (NL) and the associative Lambek Calculus(L) is obtained by extending their language by means of a so-called “combining permission”, which is used to regulate the introduction of a product formula in the scope of a derivation and to impose a control on applications of the association structural rules. A cut elimination theorem for such a system, so-called Selective Lambek Calculus, is presented.

This work was Elaborated During a Post-Doctoral Staying of the First Author in the Wilhelm-Schickard-Institut, University of Tübingen and it was Partially Supported by the Brazilian Foundation CAPES (PROBRAL/CAPES/DAAD-175/04).

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. Abrusci, V.M.: A Comparison between Lambek Syntactic Calculus and Intuitionistic Linear Propositional Logic. Zeitschr. f. Math. Logik und Grundlagen d. Math. 36, 11-15 (1990)

    Google Scholar 

  2. van Benthem, J.: The semantics of variety in categorial gramar. Report 83-29, Simon Fraser University, Burnaby (B.C) Canada (Revised version in [3]) (1983)

    Google Scholar 

  3. Buszkowski, W., Marciszewski, W., van Benthen, J.: Categorial Grammar. John Benjamins, Amsterdam (1988)

    MATH  Google Scholar 

  4. Corrêa, M., Da, S., Haeusler, E.H.: A concrete categorical model for the Lambek Calculus. Mathematical Logic Quarterly (Formerly Zeitschr. f. Math. Logik und Grundlagen d. Math.) 43, 49–59 (1997)

    MATH  Google Scholar 

  5. Corrêa, M., Da, S., Haeusler, E. H.: Selective Lambek Syntactic Calculus. In: Proceedings of the 5th Workshop on Logic, Language, Information and Computation. São Paulo, pp. 39-46. Abstract appeared in the Conference Report published in Vol 6, N. 6, of the Logic Journal of the IGPL (July 1998)

    Google Scholar 

  6. Došen, K.: Sequent systems and groupoid models. Studia Logica 47, 353–385 (1988); Studia Logica 48, 41-65 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dunn, J.M., Meyer, R.K.: Combinators and structurally free logic. Logic Journal of the IGPL 5(4), 505–537 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Heple, M.: A general framework for hybrid substructural categorial logics. Ms.IRCS Penn, Available as IRCS Report 94-14

    Google Scholar 

  9. Lambek, J.: The Mathematics of Sentence Structure. American Math. Monthly 65, 154–169 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lambek, J.: On the calculus of syntactic types. In: Structure of Language and its Mathematical Aspects. Proceedings of 12th Symp. Appl.Math., American Math. Soc., Providence,R.I, 166-178 (1961)

    Google Scholar 

  11. Kandulski, M.: The equivalence of nonassociative Lambek Categorial Grammars and context-free grammars. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 34, 41-52 (1988)

    Google Scholar 

  12. Kandulski, M.: On commutative and nonassociative syntactic calculi and categorial grammars. Mathematical Logic Quarterly 65, 217–235 (1995)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Moortgat, M.: Categorial Type Logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, ch.2. North Holland Elsevier, Amsterdam (1997)

    Google Scholar 

  15. Morrill, G.: Type Logical Grammar. Categorial Logic of Signs. Kuwer, Dordrecht (1994)

    MATH  Google Scholar 

  16. Pentus, M.: Lambek grammars are context-free. In: Proocedings of 8th Annual IEEE Symposium on Logic in Computer Science. IEEE, New York (1993)

    Google Scholar 

  17. Takeuti, G.: Proof Theory. North Holland, Amsterdan (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Matemática, Universidade Federal Fluminense, Email: ganmarc@vm.uff.br, Rua Mario S. Braga s/n, Niterói, RJ, 24020-140, Brazil

    Marcelo da S. Corrêa

  2. Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rua Marquês de São Vicente, 225, Rio de Janeiro, RJ, 22453-900, Brazil

    E. Hermann Haeusler

Authors
  1. Marcelo da S. Corrêa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Hermann Haeusler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LPL-CNRS, Université de Provence, 29 Avenue Robert Schuman, P.O. Box, 13621, Aix-en-Provence, France

    Philippe Blache

  2. Linguistics Dept., UCLA, Box 951543, 90095-1542, Los Angeles, CA, USA

    Edward Stabler

  3. ERSS, Université Bordeaux 3, CNRS, Domaine Universitaire, 33607, Pessac Cedex, France

    Joan Busquets

  4. LaBRI, Université Bordeaux 1, CNRS, 351, Cours de la Libération, 33405, Talence Cedex, France

    Richard Moot

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

da S. Corrêa, M., Haeusler, E.H. (2005). On the Selective Lambek Calculus. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_5

Download citation

  • DOI: https://doi.org/10.1007/11422532_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25783-7

  • Online ISBN: 978-3-540-31953-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation