Algebraic structures in categorial grammar

DOI10.1016/S0304-3975(97)00266-1zbMath0902.68108MaRDI QIDQ1129119

Wojciech Buszkowski

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Lambek calculuscategorial grammartype algebrasresiduated semigrouptype logics

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Language-theoretic and finite relation models for the (full) Lambek calculus ⋮ Complexity of the universal theory of residuated ordered groupoids ⋮ Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus ⋮ On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Essays in logical semantics
• Gaifman's theorem on categorial grammars revisited
• Language in action. Categories, lambdas and dynamic logic
• An algebraic approach to non-classical logics
• The logic of information structures
• Lambek calculus and its relational semantics: Completeness and incompleteness
• On the completeness of the Lambek calculus with respect to relativized relational semantics
• Identification in the limit of categorial grammars
• Lambek calculus is NP-complete
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• The finite model property for BCI and related systems
• Categorial grammars determined from linguistic data by unification
• Completeness Results for Lambek Syntactic Calculus
• The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
• Compatibility of a Categorial Grammar With an Associated Category System
• Some Decision Problems in the Theory of Syntactic Categories
• Normal form of derivations in the nonassociative and commutative lambek calculus with product
• Learning categorial grammar by unification with negative constraints
• Powerset Residuated Algebras and Generalized Lambek Calculus
• Product-free Lambek calculus and context-free grammars
• The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars

This page was built for publication: Algebraic structures in categorial grammar