Calculi for an Intuitionistic Hybrid Modal Logic

In this paper we study proof-search in an intuitionistic hybrid modal logic (for places), denoted IHML P , whose modalities allow us to validate properties taking into account the notion of place. In this context we propose different sequent calculi for this logic and also tableau rules in the perspective of proof-search and countermodel generation. As this logic can be seen as an instance of Hybrid IS5 we can derive new calculi and procedures for this logic. Finally we dene a terminating calculus for the -free fragment of IHMLP and then propose a decision procedure with countermodel generation.

[1]  David J. Pym,et al.  The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[2]  Dominique Larchey-Wendling,et al.  Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic , 1999, ASIAN.

[3]  David Walker,et al.  Modal Proofs as Distributed Programs (Extended Abstract) , 2004, ESOP.

[4]  David J. Pym,et al.  Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic , 2007, Computation, Meaning, and Logic.

[5]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[6]  Helmut Schwichtenberg,et al.  Basic proof theory , 1996, Cambridge tracts in theoretical computer science.

[7]  Roy Dyckhoff,et al.  Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[8]  Frank Pfenning.  Structural Cut Elimination: I. Intuitionistic and Classical Logic , 2000, Inf. Comput..

[9]  Alex K. Simpson,et al.  The proof theory and semantics of intuitionistic modal logic , 1994 .

[10]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[11]  Nicolas Biri,et al.  Models and Separation Logics for Resource Trees , 2007, J. Log. Comput..

[12]  Frank Pfenning,et al.  Structural cut elimination , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[13]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[14]  R. C.,et al.  A Hybrid Intuitionistic Logic : Semantics and Decidability , 2005 .