Explorations in Subexponential Non-associative Non-commutative Linear Logic

DOI10.4204/eptcs.381.3arXiv2308.05537OpenAlexW4385448550MaRDI QIDQ6196498

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

Publication date: 14 March 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic of natural languages (03B65) Logic in computer science (03B70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• A framework for proof systems
• A logical framework with commutative and non-commutative subexponentials
• Display logic
• Classical non-associative Lambek calculus
• Multimodal linguistic inference
• Non-associative, non-commutative multi-modal linear logic
• Focused proof-search in the logic of bunched implications
• Parsing/theorem-proving for logical grammar \textit{CatLog3}
• On Classical Nonassociative Lambek Calculus
• The Mathematics of Sentence Structure
• Quantales and (noncommutative) linear logic
• Classical and Intuitionistic Subexponential Logics Are Equally Expressive
• Some Syntactical Observations on Linear Logic
• Logic Programming with Focusing Proofs in Linear Logic
• A uniform framework for substructural logics with modalities
• Around Classical and Intuitionistic Linear Logics
• Subexponentials in non-commutative linear logic
• UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS
• A comparison between lambek syntactic calculus and intuitionistic linear propositional logic