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

DOI10.1007/978-3-031-10769-6_27MaRDI QIDQ2104536zbMATH OpenOpenAlexFDO

Authors Eben Blaisdell, Stepan Kuznetsov, Elaine Pimentel, Max Kanovich, Andre Scedrov

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

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)

Cites work

• scientific article; zbMATH DE number 517072 (Why is no real title available?)
• scientific article; zbMATH DE number 1841813 (Why is no real title available?)
• scientific article; zbMATH DE number 3251420 (Why is no real title available?)
• A comparison between lambek syntactic calculus and intuitionistic linear propositional logic
• A framework for proof systems
• A logical framework with commutative and non-commutative subexponentials
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• A uniform framework for substructural logics with modalities
• An extended framework for specifying and reasoning about proof systems
• Annotation-free sequent calculi for full intuitionistic linear logic
• Classical non-associative Lambek calculus
• Cyclic Involutive Distributive Full Lambek Calculus is Decidable
• Decidability of linear affine logic
• Decision problems for propositional linear logic
• Display logic
• Focused proof-search in the logic of bunched implications
• Lambek calculus is NP-complete
• Language and grammar. Studies in mathematical linguistics and natural language
• Linear logic
• Modular focused proof systems for intuitionistic modal logics
• Multimodal Linguistic Inference
• Multimodal linguistic inference
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• On subexponentials, focusing and modalities in concurrent systems
• On the complexity of nonassociative Lambek calculus with unit
• On the decision problem for MELL
• On the recognizing power of the Lambek calculus with brackets
• Parsing/theorem-proving for logical grammar \textit{CatLog3}
• Subexponentials in non-commutative 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 multiplicative-additive Lambek calculus with subexponential and bracket modalities
• Undecidability of consequence relation in full non-associative Lambek calculus
• Undecidability of multiplicative subexponential logic
• Undecidability of the Lambek calculus with a relevant modality

Cited in

(7)

• scientific article; zbMATH DE number 5252383 (Why is no real title available?)
• Relations and non-commutative linear logic
• Dynamic non-commutative logic
• Explorations in Subexponential Non-associative Non-commutative Linear Logic
• Non-commutative logic for compositional distributional semantics
• On noncommutative extensions of linear logic
• Non-commutative propositional logic with short-circuit evaluation

Describes a project that uses

Uses Software

• CatLog3
• Grail

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

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