Semantic Analysis of Subexponential Modalities in Distributive Non-commutative Linear Logic
From MaRDI portal
Publication:6196503
DOI10.4204/eptcs.381.7arXiv2308.04521MaRDI QIDQ6196503
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.04521
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
- Linear logic
- A Sahlqvist theorem for distributive modal logic
- Residuated lattices. An algebraic glimpse at substructural logics
- The linear abstract machine
- The semantics of entailment. II
- A Sahlqvist theorem for relevant modal logics
- Duality for algebras of relevant logics
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities
- Algorithmic correspondence and canonicity for non-distributive logics
- A View of Canonical Extension
- Kripke models for linear logic
- The Mathematics of Sentence Structure
- Bounded distributive lattice expansions
- Subexponentials in non-commutative linear logic
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Boolean Algebras with Operators. Part I
- Completely Distributive Complete Lattices
- Topological duality and algebraic completions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Semantic Analysis of Subexponential Modalities in Distributive Non-commutative Linear Logic