Semantical analysis of the logic of bunched implications
Semantical analysis of the logic of bunched implications
We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason with eigenworlds (i.e., generic representatives of worlds) in an arbitrary model. This reasoning is captured by a sequent calculus for a meta-logic (in this case, first-order classical logic) expressive enough to capture the semantics of the object-logic. Essentially, one has a calculus of validity for the object-logic. The method proceeds through the perspective of reductive logic (as opposed to the more traditional paradigm of deductive logic), using the space of reductions as a medium for showing the behavioural equivalence of reduction in the sequent calculus for the object-logic and in the validity calculus. Rather than study the technique in general, we illustrate it for the logic of Bunched Implications (BI), thus IPL and MILL (without negation) are also treated. Intuitively, BI is the free combination of intuitionistic propositional logic and multiplicative intuitionistic linear logic, which renders its meta-theory is quite complex. The literature on BI contains many similar, but ultimately different, algebraic structures and satisfaction relations that either capture only fragments of the logic (albeit large ones) or have complex clauses for certain connectives (e.g., Beth’s clause for disjunction instead of Kripke’s). It is this complexity that motivates us to use BI as a case-study for this approach to semantics.
525-571
Gheorghiu, Alexander V.
4569dbd7-8426-4631-80a1-424e922436da
Pym, David J.
dcd2c0b6-80dd-4486-9649-8f0ee547d110
31 August 2023
Gheorghiu, Alexander V.
4569dbd7-8426-4631-80a1-424e922436da
Pym, David J.
dcd2c0b6-80dd-4486-9649-8f0ee547d110
Gheorghiu, Alexander V. and Pym, David J.
(2023)
Semantical analysis of the logic of bunched implications.
Studia Logica, 111, .
(doi:10.1007/s11225-022-10028-z).
Abstract
We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason with eigenworlds (i.e., generic representatives of worlds) in an arbitrary model. This reasoning is captured by a sequent calculus for a meta-logic (in this case, first-order classical logic) expressive enough to capture the semantics of the object-logic. Essentially, one has a calculus of validity for the object-logic. The method proceeds through the perspective of reductive logic (as opposed to the more traditional paradigm of deductive logic), using the space of reductions as a medium for showing the behavioural equivalence of reduction in the sequent calculus for the object-logic and in the validity calculus. Rather than study the technique in general, we illustrate it for the logic of Bunched Implications (BI), thus IPL and MILL (without negation) are also treated. Intuitively, BI is the free combination of intuitionistic propositional logic and multiplicative intuitionistic linear logic, which renders its meta-theory is quite complex. The literature on BI contains many similar, but ultimately different, algebraic structures and satisfaction relations that either capture only fragments of the logic (albeit large ones) or have complex clauses for certain connectives (e.g., Beth’s clause for disjunction instead of Kripke’s). It is this complexity that motivates us to use BI as a case-study for this approach to semantics.
Text
s11225-022-10028-z
- Version of Record
More information
Accepted/In Press date: 17 November 2022
Published date: 31 August 2023
Identifiers
Local EPrints ID: 502009
URI: http://eprints.soton.ac.uk/id/eprint/502009
ISSN: 0039-3215
PURE UUID: 6cbb0251-b995-483b-99d4-4dd09cbc5319
Catalogue record
Date deposited: 13 Jun 2025 16:35
Last modified: 14 Jun 2025 02:30
Export record
Altmetrics
Contributors
Author:
Alexander V. Gheorghiu
Author:
David J. Pym
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics