Parsing pregroup grammars and Lambek calculus using partial composition

DOI10.1007/S11225-007-9084-3zbMATH Open1133.03011OpenAlexW2135783305MaRDI QIDQ2467213FDOQ2467213

Denis Béchet

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-9084-3

Recommendations

• Pregroup Calculus as a Logic Functor
• A modular and parameterized presentation of pregroup calculus
• scientific article; zbMATH DE number 1786547
• Pregroup grammars, their syntax and semantics
• Fully Lexicalized Pregroup Grammars

zbMATH Keywords

context-free grammarslinear logicparsingLambek calculuspregroup

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42)

Cites Work

• Linear logic
• Quantales and (noncommutative) linear logic
• The Mathematics of Sentence Structure
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• The structure of multiplicatives
• Type grammars as pregroups
• Product-free Lambek calculus and context-free grammars
• Title not available (Why is that?)
• Minimality of the correctness criterion for multiplicative proof nets
• Title not available (Why is that?)

Cited In (3)

• NP-Completeness of Grammars Based Upon Products of Free Pregroups
• Learnability of pregroup grammars
• Type logics and pregroups

This page was built for publication: Parsing pregroup grammars and Lambek calculus using partial composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467213)