Algebraic structures in categorial grammar
type: Item
instance of: scholarly article
title: Algebraic structures in categorial grammar
zbMATH Open document ID: 0902.68108
DOI: 10.1016/S0304-3975(97)00266-1
author: Wojciech Buszkowski
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1190224
zbMATH Keywords: categorial grammar
zbMATH Keywords: type logics
zbMATH Keywords: type algebras
zbMATH Keywords: Lambek calculus
zbMATH Keywords: residuated semigroup
MaRDI profile type: Publication
cites work: Lambek calculus and its relational semantics: Completeness and incompleteness
cites work: Q5536273
cites work: Q5541333
cites work: Essays in logical semantics
cites work: Language in action. Categories, lambdas and dynamic logic
cites work: Compatibility of a Categorial Grammar With an Associated Category System
cites work: Some Decision Problems in the Theory of Syntactic Categories
cites work: The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
cites work: Completeness Results for Lambek Syntactic Calculus
cites work: Q3754604
cites work: Q3754605
cites work: Q3783276
cites work: Gaifman's theorem on categorial grammars revisited
cites work: The finite model property for BCI and related systems
cites work: Categorial grammars determined from linguistic data by unification
cites work: Q4940724
cites work: Linear logic
cites work: Q3862379
cites work: Q4223176
cites work: Identification in the limit of categorial grammars
cites work: The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
cites work: Normal form of derivations in the nonassociative and commutative lambek calculus with product
cites work: Powerset Residuated Algebras and Generalized Lambek Calculus
cites work: Q3339245
cites work: Learning categorial grammar by unification with negative constraints
cites work: On the completeness of the Lambek calculus with respect to relativized relational semantics
cites work: Product-free Lambek calculus and context-free grammars
cites work: Lambek calculus is NP-complete
cites work: Q3992706
cites work: An algebraic approach to non-classical logics
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
cites work: The logic of information structures
description: scientific article; zbMATH DE number 1190224