Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus
From MaRDI portal
Publication:2964014
DOI10.1007/978-3-662-53826-5_19zbMath1485.03056OpenAlexW2550429615MaRDI QIDQ2964014
Publication date: 22 February 2017
Published in: Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53826-5_19
Formal languages and automata (68Q45) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finite models of the Lambek calculus
- Residuated lattices. An algebraic glimpse at substructural logics
- Algebraic structures in categorial grammar
- Language in action. Categories, lambdas and dynamic logic
- The Lambek calculus enriched with additional connectives
- Models for the Lambek calculus
- Relations and non-commutative linear logic
- On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results
- Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm
- A Learnable Representation for Syntax Using Residuated Lattices
- 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
- Completeness of Full Lambek Calculus for Syntactic Concept Lattices
This page was built for publication: Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus