Skip to main content

Lambek Grammars with the Unit

  • Conference paper
Formal Grammar (FG 2010, FG 2011)

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

Abstract

Pentus’ theorem states that any language generated by a Lambek grammar is context-free. We present a substitution that reduces the Lambek calculus enriched with the unit constant to the variant of the Lambek calculus that does not contain the unit (but still allows empty premises), and use this substitution to prove that any language generated by a categorial grammar based on the Lambek calculus with the unit is context-free.

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

Access this chapter

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

  • Bar-Hillel, Y., Gaifman, C., Shamir, E.: On categorial and phrase-structure grammars. Bull. Res. Council Israel Sect. F 9F, 1–16 (1960)

    MathSciNet  Google Scholar 

  • Buszkowski, W.: The equivalence of unidirectional Lambek categorial grammars and context-free grammars. Zeitschr. fĂĽr math. Logik und Grundl. der Math. 31, 369–384 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  • Kuznetsov, S.: Lambek grammars with one division and one primitive type. Unpublished manuscript (2010)

    Google Scholar 

  • Lambek, J.: The mathematics of sentence structure. American Math. Monthly 65(3), 154–170 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  • Lambek, J.: Deductive systems and categories II: Standard constructions and closed categories. In: Hilton, P. (ed.) Category Theory, Homology Theory and Their Applications I. Lect. Notes Math., vol. 86, pp. 76–122. Springer, Berlin (1969)

    Chapter  Google Scholar 

  • MĂ©tayer, F.: Polynomial equivalence among systems LLNC, LLNC a and LLNC0. Theor. Comput. Sci. 227(1), 221–229 (1999)

    Article  MATH  Google Scholar 

  • Pentus, M.: Lambek grammars are context free. In: Proc. of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433. IEEE Computer Society Press, Los Alamitos (1993)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuznetsov, S. (2012). Lambek Grammars with the Unit. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32024-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32023-1

  • Online ISBN: 978-3-642-32024-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics