The Logic of Bunched Implications
- 1 June 1999
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of Symbolic Logic
- Vol. 5 (2) , 215-244
- https://doi.org/10.2307/421090
Abstract
We introduce a logicBIin which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version ofBIarises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality ofBIcan be seen categorically: models of propositionalBI's proofs are given by bicartesian doubly closed categories, i.e., categories which freely combine the semantics of propositional intuitionistic logic and propositional multiplicative intuitionistic linear logic. The predicate version ofBIincludes, in addition to standard additive quantifiers, multiplicative (or intensional) quantifiersandwhich arise from observing restrictions on structural rules on the level of terms as well as propositions. We discuss computational interpretations, based on sharing, at both the propositional and predicate levels.This publication has 22 references indexed in Scilit:
- Logic Programming with Bunched Implications: Extended AbstractElectronic Notes in Theoretical Computer Science, 1998
- A relevant analysis of natural deductionJournal of Logic and Computation, 1998
- A Uniform Proof-theoretic Investigation of Linear Logic ProgrammingJournal of Logic and Computation, 1994
- Computational interpretations of linear logicTheoretical Computer Science, 1993
- Structural frameworks, substructural logics, and the role of elimination inferencesPublished by Cambridge University Press (CUP) ,1991
- Handbook of Philosophical Logic, Vol. IV: Topics in the Philosophy of LanguageLanguage, 1990
- Introduction to Higher Order Categorical Logic.The Journal of Symbolic Logic, 1989
- A logical analysis of modules in logic programmingThe Journal of Logic Programming, 1989
- The linear abstract machineTheoretical Computer Science, 1988
- An embedding theorem for closed categoriesPublished by Springer Nature ,1974