Automatic concepts and automata-theoretic semantics for the full Lambek calculus
From MaRDI portal
Publication:2964014
Recommendations
- Language-theoretic and finite relation models for the (full) Lambek calculus
- scientific article; zbMATH DE number 1689588
- A Lambek Automaton
- Lambek calculus and its relational semantics: Completeness and incompleteness
- Relational semantics of the Lambek calculus extended with classical propositional logic
Cites work
- scientific article; zbMATH DE number 3169897 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- A learnable representation for syntax using residuated lattices
- Algebraic structures in categorial grammar
- Completeness Results for Lambek Syntactic Calculus
- Completeness of full Lambek calculus for syntactic concept lattices
- Language in action. Categories, lambdas and dynamic logic
- Learning context free grammars with the finite context property: a correction of A. Clark's algorithm
- Learning context free grammars with the syntactic concept lattice
- Models for the Lambek calculus
- On finite models of the Lambek calculus
- On some extensions of syntactic concept lattices: completeness and finiteness results
- Relations and non-commutative linear logic
- Residuated lattices. An algebraic glimpse at substructural logics
- The Lambek calculus enriched with additional connectives
- The Mathematics of Sentence Structure
- The finite model property for various fragments of intuitionistic linear logic
- The syntactic concept lattice: another algebraic theory of the context-free languages?
- The universal automaton
Cited in
(3)
This page was built for publication: Automatic concepts and automata-theoretic semantics for the full Lambek calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964014)