Skip to main content
SpringerLink
Log in

Recognition of derivability for the Lambek calculus with one division

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

A polynomial algorithm for determination of derivability in the Lambek calculus with one division is described in the paper.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. Lambek, “The Mathematics of Sentence Structure,” Amer. Math. Monthly, 65, 154 (1958).

    Article  MATH  MathSciNet  Google Scholar 

  2. W. Buszkowski, “The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars,” Z. Math. Log. und Grundl. Math. 31(4), 369 (1985).

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Pentus, “Lambek Calculus is NP-Complete,” Theor. Comput. Sci. 357(1–3), 186 (2006).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119899, Russia

    Yu. V. Savateev

Authors
  1. Yu. V. Savateev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © Yu.V. Savateev, 2009, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2009, Vol. 64, No. 2, pp. 59–62.

About this article

Cite this article

Savateev, Y.V. Recognition of derivability for the Lambek calculus with one division. Moscow Univ. Math. Bull. 64, 73–75 (2009). https://doi.org/10.3103/S0027132209020077

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132209020077

Keywords

Search

Navigation