Coalgebraic completeness-via-canonicity for distributive substructural logics

DOI10.1016/j.jlamp.2017.07.002zbMath1453.03020arXiv1508.04940OpenAlexW2963648697MaRDI QIDQ2409626

Fredrik Dahlqvist, David J. Pym

Publication date: 13 October 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

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

zbMATH Keywords

completenesssubstructural logiccoalgebraic logicseparation logiccanonicityresource modelling

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items

Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Generalized Kripke frames
• Residuated lattices. An algebraic glimpse at substructural logics
• Lambek calculus and its relational semantics: Completeness and incompleteness
• On the canonicity of Sahlqvist identities
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• Positive modal logic
• Modular construction of complete coalgebraic logics
• Positive Fragments of Coalgebraic Logics
• Layered graph logic as an assertion language for access control policy models
• CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
• Exemplaric Expressivity of Modal Logics
• Relation Liftings on Preorders and Posets
• On the Fusion of Coalgebraic Logics
• Context logic as modal logic
• The semantics of BI and resource tableaux
• A Modal BI Logic for Dynamic Resource Properties
• Completeness via Canonicity for Distributive Substructural Logics: A Coalgebraic Perspective
• Algebra and logic for resource-based systems modelling
• The Logic of Bunched Implications
• Bounded distributive lattice expansions
• Some Sahlqvist Completeness Results for Coalgebraic Logics
• BI as an assertion language for mutable data structures
• Sub-classical Boolean Bunched Logics and the Meaning of Par
• Algebra and Coalgebra in Computer Science
• Canonical extensions and relational completeness of some substructural logics
• Bounded lattice expansions