On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results
From MaRDI portal
Publication:2835051
DOI10.1007/978-3-662-53042-9_10zbMath1478.03047OpenAlexW2499743893MaRDI QIDQ2835051
Publication date: 1 December 2016
Published in: Formal Grammar (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53042-9_10
Knowledge representation (68T30) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items
Language-theoretic and finite relation models for the (full) Lambek calculus, Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus
Cites Work
- Unnamed Item
- Unnamed Item
- On finite models of the Lambek calculus
- Residuated lattices. An algebraic glimpse at substructural logics
- Algebraic structures in categorial grammar
- The Lambek calculus enriched with additional connectives
- The displacement calculus
- A Learnable Representation for Syntax Using Residuated Lattices
- Well-Nestedness Properly Subsumes Strict Derivational Minimalism
- The Mathematics of Sentence Structure
- The syntactic concept lattice: Another algebraic theory of the context-free languages?
- Learning Context Free Grammars with the Syntactic Concept Lattice
- Completeness Results for Lambek Syntactic Calculus
- The finite model property for various fragments of intuitionistic linear logic
- Logical Grammars, Logical Theories
- Completeness of Full Lambek Calculus for Syntactic Concept Lattices