scientific article; zbMATH DE number 6970800

DOI10.23638/LMCS-14(4:11)2018zbMath1454.03030arXiv1702.05795MaRDI QIDQ4553286

Simon Docherty, David J. Pym

Publication date: 2 November 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

modellingtableauxgraphsdecidabilityalgebraic semanticscomplex systemssubstructural logicKripke semanticsfinite model propertypredicate logicsoundness and completenessbunched logicbigraphslayered graphshyperdoctrinepointer logicStone-type dualitylayered graph logic

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Semantical analysis of the logic of bunched implications ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Generalising canonical extension to the categorical setting
• A calculus and logic of bunched resources and processes
• Distributive residuated frames and generalized bunched implication algebras
• Stable formulas in intuitionistic logic
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• The finite embeddability property for residuated groupoids.
• Tableau methods of proof for modal logics
• Intuitionistic Layered Graph Logic
• A substructural logic for layered graphs
• The semantics of BI and resource tableaux
• Tableaux and Resource Graphs for Separation Logic
• A Modal BI Logic for Dynamic Resource Properties
• The Space and Motion of Communicating Agents
• Algebra and logic for resource-based systems modelling
• The Logic of Bunched Implications
• BI as an assertion language for mutable data structures
• Directed Bigraphs
• Resource-distribution via Boolean constraints
• Programming Languages and Systems
• Compositional Shape Analysis by Means of Bi-Abduction
• Automata, Languages and Programming
• The formal strong completeness of partial monoidal Boolean BI
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs