scientific article; zbMATH DE number 7204441

DOI10.4230/LIPICS.FSCD.2017.22MaRDI QIDQ5111318zbMATH OpenFDO

Authors Glyn Morrill, Max Kanovich, Stepan Kuznetsov, Andre Scedrov

Publication date 26 May 2020

Full work available at URL https://arxiv.org/abs/1705.00694

zbMATH Keywords

polynomial algorithmproof netsLambek calculuscategorial grammarLambek calculus with brackets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• A polynomial time algorithm for parsing with the bounded order Lambek calculus
• Proving theorems of the second order Lambek calculus in polynomial time
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Unidirectional Lambek grammars in polynomial time

Cites work

• scientific article; zbMATH DE number 3179944 (Why is no real title available?)
• scientific article; zbMATH DE number 1222927 (Why is no real title available?)
• scientific article; zbMATH DE number 1341472 (Why is no real title available?)
• scientific article; zbMATH DE number 1341604 (Why is no real title available?)
• scientific article; zbMATH DE number 1175489 (Why is no real title available?)
• scientific article; zbMATH DE number 2070201 (Why is no real title available?)
• scientific article; zbMATH DE number 786497 (Why is no real title available?)
• scientific article; zbMATH DE number 3251420 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• A graph-theoretic approach to sequent derivability in the Lambek calculus
• A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
• Lambek calculus is NP-complete
• Lambek grammars with one division and one primitive type
• Linear logic
• Models for the Lambek calculus
• Multimodal linguistic inference
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• On the generative capacity of multi-modal categorial grammars
• On translating Lambek grammars with one division into context-free grammars
• Proving theorems of the second order Lambek calculus in polynomial time
• Quantales and (noncommutative) linear logic
• Talking about Explicit Databases in Categorial Grammar
• The Mathematics of Sentence Structure
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• The structure of multiplicatives
• Undecidability of the Lambek calculus with a relevant modality
• Unidirectional Lambek grammars in polynomial time

Cited in

(9)

• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Bracket induction for Lambek calculus with bracket modalities
• On the recognizing power of the Lambek calculus with brackets
• A polynomial time algorithm for parsing with the bounded order Lambek calculus
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities
• Explorations in Subexponential Non-associative Non-commutative Linear Logic
• Proving theorems of the second order Lambek calculus in polynomial time
• A count invariant for Lambek calculus with additives and bracket modalities
• Unidirectional Lambek grammars in polynomial time

This page was built for publication:

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