The formal strong completeness of partial monoidal Boolean BI
From MaRDI portal
Publication:5739976
DOI10.1093/logcom/exu031zbMath1345.03025OpenAlexW2330028608MaRDI QIDQ5739976
Publication date: 7 July 2016
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exu031
Mechanization of proofs and logical operations (03B35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items (10)
A stone-type duality theorem for separation logic via its underlying bunched logics ⋮ A logic of separating modalities ⋮ Completeness for a First-Order Abstract Separation Logic ⋮ An Epistemic Separation Logic ⋮ A public announcement separation logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Intuitionistic Layered Graph Logic ⋮ A Substructural Epistemic Resource Logic
Uses Software
This page was built for publication: The formal strong completeness of partial monoidal Boolean BI
