Abstract
Abstract It is known that the logic BI of bunched implications is useful for describing shared mutable data structures and resource-aware reasoning. It has recently been clarified that some classical versions of BI are especially useful for describing shared mutable data structures. In this paper, a single-succedent Gentzen-type sequent calculus GcBI for a classical version (called Boolean BI) of an intuitionistic BI is introduced. Some theorems for embedding GcBI into its intuitionistic version GiBI, which are analogous to the Glivenko and Godel-Gentzen embedding theorems of classical logic into intuitionistic logic, are proved.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
