21808 articles – 15604 references  [version française]
HAL: hal-00577919, version 1

Detailed view  Export this paper
25th Annual IEEE Symposium on Logic in Computer Science - LICS 2010, Edinburgh : United Kingdom (2010)
The Undecidability of Boolean BI through Phase Semantics
Dominique Larchey-Wendling 1, Didier Galmiche 1
(2010)

We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phase semantics for BBI and characterize it as trivial phase semantics. We deduce an embedding between trivial phase semantics for intuitionistic linear logic (ILL) and Kripke semantics for BBI. We single out a fragment of ILL which is both undecidable and complete for trivial phase semantics. Therefore, we obtain the undecidability of BBI.
1:  TYPES (LORIA)
INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
Computer Science/Logic in Computer Science

Mathematics/Logic
Attached file list to this document: 
PDF
lics10_larchey_galmiche_full.pdf(314.5 KB)