On Lambek’s Restriction in the Presence of Exponential Modalities

DOI10.1007/978-3-319-27683-0_11zbMath1476.03026OpenAlexW2239942373MaRDI QIDQ5283424

Stepan Kuznetsov, Max I. Kanovich, Andrej Scedrov

Publication date: 21 July 2017

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_11

zbMATH Keywords

undecidabilityLambek calculuslinear logicexponential modalitiesLambek's restriction

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

The multiplicative-additive Lambek calculus with subexponential and bracket modalities, Undecidability of the Lambek Calculus with a Relevant Modality, Subexponentials in non-commutative linear logic

Cites Work

• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• Linear logic
• Decision problems for propositional linear logic
• Lambek calculus is NP-complete
• The Mathematics of Sentence Structure
• Quantales and (noncommutative) linear logic
• Lambek Grammars with One Division Are Decidable in Polynomial Time
• Focusing in Linear Meta-logic
• Product-Free Lambek Calculus Is NP-Complete
• Some Decision Problems in the Theory of Syntactic Categories
• Logic Programming with Focusing Proofs in Linear Logic
• A comparison between lambek syntactic calculus and intuitionistic linear propositional logic