Boolean BI is Decidable (via Display Logic)
by
James Brotherston
BibTeX
@MISC{Brotherston_booleanbi,
author = {James Brotherston},
title = {Boolean BI is Decidable (via Display Logic)},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give a display calculus proof system for Boolean BI (BBI) based on Belnap’s general display logic. We show that cut-elimination holds in our system and that it is sound and complete with respect to the usual notion of validity for BBI. We then demonstrate that proof search in the system can be restricted to a finitely bounded space (without loss of generality). Thus provability in our display calculus is decidable, and consequently so too is validity in BBI. 1.
