University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Classical BI (A Logic for Reasoning About Dualising Resource)

Classical BI (A Logic for Reasoning About Dualising Resource)

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Parkinson.

We show how to extend O’Hearn and Pym’s logic of bunched implications, BI, to classical BI (CBI), in which both the additive and the multiplicative connectives behave classically. Specifically, CBI is a non-conservative extension of (propositional) boolean BI that includes multiplicative versions of falsity, negation and disjunction. We give an algebraic semantics for CBI that leads us naturally to consider resource models of CBI in which every resource has a unique dual. We then give a cut-eliminating proof system for CBI , based on Belnap’s display logic, and demonstrate soundness and completeness of this proof system with respect to our semantics.

(Joint work with Cristiano Calcagno)

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity