Kripke Models of Boolean BI and Invertible Resources

Dominique Larchey-Wendling (1)

1 TYPES - Logic, proof Theory and Programming

We study the models generated by proof-search in the Boolean BI tableau calculus. Contrary to (intuitionistic) BI, the generated models can be infinite because some resources could be invertible. We show how to manage this new setting.

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]

Dominique Larchey-Wendling. Kripke Models of Boolean BI and Invertible Resources. Domains IX Workshop 08, Sep 2008, Brighton, United Kingdom. pp.1. ⟨hal-00580400⟩