Computer Science – Logic in Computer Science
Scientific paper
2010-05-13
LMCS 6 (3:3) 2010
Computer Science
Logic in Computer Science
42 pages, 8 figures
Scientific paper
10.2168/LMCS-6(3:3)2010
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including in particular a multiplicative version of classical negation). At the semantic level, CBI-formulas have the normal bunched logic reading as declarative statements about resources, but its resource models necessarily feature more structure than those for other bunched logics; principally, they satisfy the requirement that every resource has a unique dual. At the proof-theoretic level, a very natural formalism for CBI is provided by a display calculus \`a la Belnap, which can be seen as a generalisation of the bunched sequent calculus for BI. In this paper we formulate the aforementioned model theory and proof theory for CBI, and prove some fundamental results about the logic, most notably completeness of the proof theory with respect to the semantics.
Brotherston James
Calcagno Cristiano
No associations
LandOfFree
Classical BI: Its Semantics and Proof Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Classical BI: Its Semantics and Proof Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical BI: Its Semantics and Proof Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-640864