Type logics and pregroups
From MaRDI portal
Publication:2467212
DOI10.1007/s11225-007-9083-4zbMath1134.03014OpenAlexW2023151831MaRDI QIDQ2467212
Publication date: 21 January 2008
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-007-9083-4
Logic of natural languages (03B65) Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items (6)
A geometrical representation of the basic laws of categorial grammar ⋮ Lattice-ordered pregroups are semi-distributive ⋮ On Residuation ⋮ Italian Clitic Patterns in Pregroup Grammar: State of the Art ⋮ Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars ⋮ Periodic lattice-ordered pregroups are distributive
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Language in action. Categories, lambdas and dynamic logic
- The Lambek calculus enriched with additional connectives
- Residuation, structural rules and context freeness
- From semirings to residuated Kleene lattices
- Models for the Lambek calculus
- Parsing pregroup grammars and Lambek calculus using partial composition
- Commutation-augmented pregroup grammars and mildly context-sensitive languages
- On the logic of \(\beta\)-pregroups
- Should pregroup grammars be adorned with additional operations?
- Lambek calculus is NP-complete
- The Mathematics of Sentence Structure
- On Action Logic: Equational Theories of Action Algebras
- Free compact 2-categories
- Quantales and (noncommutative) linear logic
- Completeness Results for Lambek Syntactic Calculus
- The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
- Some Decision Problems in the Theory of Syntactic Categories
- Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
- Normal form of derivations in the nonassociative and commutative lambek calculus with product
- Sequent systems for compact bilinear logic
- Logical Aspects of Computational Linguistics
- Type grammars as pregroups
This page was built for publication: Type logics and pregroups