Skip to main content
Conference Proceedings

Completeness of full Lambek calculus for syntactic concept lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8036 LNCS 126-141
DOI: 10.1007/978-3-642-39998-5_8
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Wurm, C. (2013). Completeness of full Lambek calculus for syntactic concept lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8036 LNCS, pp. 126–141). https://doi.org/10.1007/978-3-642-39998-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free