Non-associative, non-commutative multi-modal linear logic

DOI10.1007/978-3-031-10769-6_27OpenAlexW4289104061MaRDI QIDQ2104536

Eben Blaisdell, Elaine Pimentel, Stepan Kuznetsov, Max I. Kanovich, Andrej Scedrov

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_27

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Explorations in Subexponential Non-associative Non-commutative Linear Logic

Uses Software

• Grail
• CatLog3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• Linear logic
• A framework for proof systems
• On the complexity of nonassociative Lambek calculus with unit
• Decision problems for propositional linear logic
• On the recognizing power of the Lambek calculus with brackets
• On the decision problem for MELL
• A logical framework with commutative and non-commutative subexponentials
• Display logic
• Classical non-associative Lambek calculus
• Decidability of linear affine logic
• Multimodal linguistic inference
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities
• Focused proof-search in the logic of bunched implications
• On subexponentials, focusing and modalities in concurrent systems
• Parsing/theorem-proving for logical grammar \textit{CatLog3}
• Lambek calculus is NP-complete
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• Undecidability of the Lambek Calculus with a Relevant Modality
• Cyclic Involutive Distributive Full Lambek Calculus is Decidable
• The Mathematics of Sentence Structure
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• A uniform framework for substructural logics with modalities
• Talking about Explicit Databases in Categorial Grammar
• Multimodal Linguistic Inference
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Subexponentials in non-commutative linear logic
• Modular Focused Proof Systems for Intuitionistic Modal Logics
• UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS
• An extended framework for specifying and reasoning about proof systems
• A comparison between lambek syntactic calculus and intuitionistic linear propositional logic

This page was built for publication: Non-associative, non-commutative multi-modal linear logic