scientific article; zbMATH DE number 7204441

DOI10.4230/LIPICS.FSCD.2017.22zbMATH Open1434.03076arXiv1705.00694MaRDI QIDQ5111318FDOQ5111318

Max Kanovich, Stepan Kuznetsov, Andre Scedrov, Glyn Morrill

Publication date: 26 May 2020

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

Title of this publication is not available (Why is that?)

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

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)

Cites Work

• Lambek calculus is NP-complete
• Linear logic
• Quantales and (noncommutative) linear logic
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• The Mathematics of Sentence Structure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multimodal linguistic inference
• Title not available (Why is that?)
• The structure of multiplicatives
• Title not available (Why is that?)
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Title not available (Why is that?)
• Models for the Lambek calculus
• On the generative capacity of multi-modal categorial grammars
• Lambek grammars with one division and one primitive type
• On translating Lambek grammars with one division into context-free grammars
• Unidirectional Lambek grammars in polynomial time
• Title not available (Why is that?)
• A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus
• Talking about Explicit Databases in Categorial Grammar
• Proving theorems of the second order Lambek calculus in polynomial time
• A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
• Title not available (Why is that?)
• Undecidability of the Lambek Calculus with a Relevant Modality
• Title not available (Why is that?)

Cited In (6)

• Bracket induction for Lambek calculus with bracket modalities
• On the recognizing power of the Lambek calculus with brackets
• 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
• Non‐associative Lambek Categorial Grammar 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)