Skip to main content
SpringerLink
Log in

Completeness of Full Lambek Calculus for Syntactic Concept Lattices

  • Conference paper
Formal Grammar (FG 2013, FG 2012)

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

Abstract

Syntactic concept lattices are residuated structures which arise from the distributional analysis of a language. We show that these structures form a complete class of models with respect to the logic FL  ⊥ ; furthermore, its reducts are complete with respect to FL and L1.

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. Buszkowski, W.: Completeness results for Lambek syntactic calculus. Mathematical Logic Quarterly 32(1-5), 13–28 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Buszkowski, W.: Algebraic structures in categorial grammar. Theor. Comput. Sci. 1998(1-2), 5–24 (1998)

    Article  MathSciNet  Google Scholar 

  3. Clark, A.: A learnable representation for syntax using residuated lattices. In: de Groote, P., Egg, M., Kallmeyer, L. (eds.) FG 2009. LNCS (LNAI), vol. 5591, pp. 183–198. Springer, Heidelberg (2011)

    Google Scholar 

  4. Clark, A.: Learning context free grammars with the syntactic concept lattice. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 38–51. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Clark, A.: Logical grammars, logical theories. In: Béchet, D., Dikovsky, A. (eds.) LACL 2012. LNCS, vol. 7351, pp. 1–20. Springer, Heidelberg (2012)

    Google Scholar 

  6. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (1991)

    Google Scholar 

  7. Farulewski, M.: On Finite Models of the Lambek Calculus. Studia Logica 80(1), 63–74 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier (2007)

    Google Scholar 

  9. Harris, Z.S.: Structural Linguistics. The University of Chicago Press (1963)

    Google Scholar 

  10. Kanazawa, M.: The Lambek calculus enriched with additional connectives. Journal of Logic, Language, and Information 1, 141–171 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (ed.) Structure of Language and its Mathematical Aspects, pp. 166–178. American Mathematical Society, Providence (1961)

    Chapter  Google Scholar 

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

  14. Okada, M., Terui, K.: The finite model property for various fragments of intuitionistic linear logic. J. Symb. Log. 64(2), 790–802 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  16. Sestier, A.: Contributions à une théorie ensembliste des classifications linguistiques (Contributions to a set–theoretical theory of classifications). In: Actes du Ier Congrès de l’AFCAL, Grenoble, pp. 293–305 (1960)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Linguistik und Literaturwissenschaften, CITEC Universität Bielefeld, Germany

    Christian Wurm

Authors
  1. Christian Wurm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Glyn Morrill

  2. School of Computer Science, University of St Andrews, North Haugh, KY16 9SX, St. Andrews, UK

    Mark-Jan Nederhof

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wurm, C. (2013). Completeness of Full Lambek Calculus for Syntactic Concept Lattices. In: Morrill, G., Nederhof, MJ. (eds) Formal Grammar. FG FG 2013 2012. Lecture Notes in Computer Science, vol 8036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39998-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39998-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39997-8

  • Online ISBN: 978-3-642-39998-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation