Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423237 | Electronic Notes in Theoretical Computer Science | 2010 | 15 Pages |
Abstract
We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations. We show that the standard sequent calculus for BI can be seen as a reformulation of its display calculus, and argue that analogous sequent calculi for the other varieties of bunched logic seem very unlikely to exist.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics