7,015 research outputs found

    On the Complexity of Modal Separation Logics

    Get PDF
    International audienceWe introduce a modal separation logic MSL whose models are memory states from separation logic and the logical connectives include modal operators as well as separating conjunction and implication from separation logic. With such a combination of operators, some fragments of MSL can be seen as genuine modal logics whereas some others capture standard separation logics, leading to an original language to speak about memory states. We analyse the decidability status and the computational complexity of several fragments of MSL, leading to surprising results, obtained by designing proof methods that take into account the modal and separation features of MSL. For example, the satisfiability problem for the fragment of MSL with 3, the inequality modality = and separating conjunction * is shown Tower-complete whereas the restriction either to 3 and * or to = and * is only NP-complete

    Topological Semantics and Decidability

    Get PDF
    It is well-known that the basic modal logic of all topological spaces is S4S4. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal logics of T0T_0, T1T_1 and T2T_2 topological spaces coincide and are S4.Wealsoexaminebasichybridlogicsoftheseclassesandprovetheirdecidability;aspartofthis,wefindoutthatthehybridlogicsof. We also examine basic hybrid logics of these classes and prove their decidability; as part of this, we find out that the hybrid logics of T_1andT2 and T_2 spaces coincide.Comment: presentation changes, results about concrete structure adde

    A Team Based Variant of CTL

    Full text link
    We introduce two variants of computation tree logic CTL based on team semantics: an asynchronous one and a synchronous one. For both variants we investigate the computational complexity of the satisfiability as well as the model checking problem. The satisfiability problem is shown to be EXPTIME-complete. Here it does not matter which of the two semantics are considered. For model checking we prove a PSPACE-completeness for the synchronous case, and show P-completeness for the asynchronous case. Furthermore we prove several interesting fundamental properties of both semantics.Comment: TIME 2015 conference version, modified title and motiviatio

    Sequent Calculus in the Topos of Trees

    Full text link
    Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of trees. We show that the semantics of the propositional fragment of this logic can be given by linear converse-well-founded intuitionistic Kripke frames, so this logic is a marriage of the intuitionistic modal logic KM and the intermediate logic LC. We therefore call this logic KMlin\mathrm{KM}_{\mathrm{lin}}. We give a sound and cut-free complete sequent calculus for KMlin\mathrm{KM}_{\mathrm{lin}} via a strategy that decomposes implication into its static and irreflexive components. Our calculus provides deterministic and terminating backward proof-search, yields decidability of the logic and the coNP-completeness of its validity problem. Our calculus and decision procedure can be restricted to drop linearity and hence capture KM.Comment: Extended version, with full proof details, of a paper accepted to FoSSaCS 2015 (this version edited to fix some minor typos

    On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics

    Full text link
    We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call "shallow calculi", where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima's calculus for tense logic and share an essential characteristic with display calculi, namely, the presence of structural rules called "display postulates". Shallow calculi enjoy a simple cut elimination procedure, but are unsuitable for proof search due to the presence of display postulates and other structural rules. The second style of calculi uses deep-inference, whereby inference rules can be applied at any node in a nested sequent. We show that, for a range of extensions of tense logic, the two styles of calculi are equivalent, and there is a natural proof theoretic correspondence between display postulates and deep inference. The deep inference calculi enjoy the subformula property and have no display postulates or other structural rules, making them a better framework for proof search

    Decidability of quantified propositional intuitionistic logic and S4 on trees

    Full text link
    Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a model structure which is upward closed. Kremer (1997) has shown that the quantified propositional intuitionistic logic H\pi+ based on the class of all partial orders is recursively isomorphic to full second-order logic. He raised the question of whether the logic resulting from restriction to trees is axiomatizable. It is shown that it is, in fact, decidable. The methods used can also be used to establish the decidability of modal S4 with propositional quantification on similar types of Kripke structures.Comment: v2, 9 pages, corrections and additions; v1 8 page
    corecore