Abstract
Just as for propositional BI soundness and completeness for BI with ⊥ may be obtained for a semantics based not on presheaves (or Set-valued functor categories) on a preordered monoid but rather based on sheaves on a commutative topological monoid. We define topological Kripke models of predicate BI and sketch the soundness and completeness arguments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pym, D.J. (2002). Topological Kripke Semantics for Predicate BI. In: The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series, vol 26. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0091-7_14
Download citation
DOI: https://doi.org/10.1007/978-94-017-0091-7_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6072-3
Online ISBN: 978-94-017-0091-7
eBook Packages: Springer Book Archive