795 research outputs found

    A Spatial-Epistemic Logic for Reasoning about Security Protocols

    Full text link
    Reasoning about security properties involves reasoning about where the information of a system is located, and how it evolves over time. While most security analysis techniques need to cope with some notions of information locality and knowledge propagation, usually they do not provide a general language for expressing arbitrary properties involving local knowledge and knowledge transfer. Building on this observation, we introduce a framework for security protocol analysis based on dynamic spatial logic specifications. Our computational model is a variant of existing pi-calculi, while specifications are expressed in a dynamic spatial logic extended with an epistemic operator. We present the syntax and semantics of the model and logic, and discuss the expressiveness of the approach, showing it complete for passive attackers. We also prove that generic Dolev-Yao attackers may be mechanically determined for any deterministic finite protocol, and discuss how this result may be used to reason about security properties of open systems. We also present a model-checking algorithm for our logic, which has been implemented as an extension to the SLMC system.Comment: In Proceedings SecCo 2010, arXiv:1102.516

    Simple cut elimination proof for hybrid logic

    Get PDF
    In the paper we present a relatively simple proof of cut elimination theorem for variety of hybrid logics in the language with satisfaction operators and universal modality. The proof is based on the strategy introduced originally in the framework of hypersequent calculi but it works well also for standard sequent calculi. Sequent calculus examined in the paper works on so called satisfaction formulae and cover all logics adequate with respect to classes of frames defined by so called geometric conditions

    Sequent calculi and decidability for intuitionistic hybrid logic

    Get PDF
    AbstractIn this paper we study the proof theory of the first constructive version of hybrid logic called Intuitionistic Hybrid Logic (IHL) in order to prove its decidability. In this perspective we propose a sequent-style natural deduction system and then the first sequent calculus for this logic. We prove its main properties like soundness, completeness and also the cut-elimination property. Finally we provide, from our calculus, the first decision procedure for IHL and then prove its decidability

    Defining Logical Systems via Algebraic Constraints on Proofs

    Full text link
    We comprehensively present a program of decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof system for a target logic by enriching a proof system for another, typically simpler, logic with an algebra of constraints that act as correctness conditions on the latter to capture the former; for example, one may use Boolean algebra to give constraints in a sequent calculus for classical propositional logic to produce a sequent calculus for intuitionistic propositional logic. The idea behind such forms of reduction is to obtain a tool for uniform and modular treatment of proof theory and provide a bridge between semantics logics and their proof theory. The article discusses the theoretical background of the project and provides several illustrations of its work in the field of intuitionistic and modal logics. The results include the following: a uniform treatment of modular and cut-free proof systems for a large class of propositional logics; a general criterion for a novel approach to soundness and completeness of a logic with respect to a model-theoretic semantics; and a case study deriving a model-theoretic semantics from a proof-theoretic specification of a logic.Comment: submitte

    Modal Hybrid Logic

    Get PDF
    This is an extended version of the lectures given during the 12-th Conference on Applications of Logic in Philosophy and in the Foundations of Mathematics in Szklarska Poręba (7–11 May 2007). It contains a survey of modal hybrid logic, one of the branches of contemporary modal logic. In the first part a variety of hybrid languages and logics is presented with a discussion of expressivity matters. The second part is devoted to thorough exposition of proof methods for hybrid logics. The main point is to show that application of hybrid logics may remarkably improve the situation in modal proof theory

    Transition systems and dynamic semantics

    Get PDF

    End-of-Life Care and the Use of an Integrated Care Pathway

    Get PDF
    Liverpool Care Pathway is an integrated care pathway (ICP) designed to ensure the provision of high-quality end-of-life care. However, the ICP has come under substantial criticism, suggesting that its use is related to poor care. This study explores nurses’ use of the ICP to dying patients in Norwegian nursing homes. We conducted a qualitative study using an abductive, mystery-focused method to analyze the experiences of 12 registered nurses. Our findings show that the nurses experienced the ICP as a very useful tool in end-of-life care, although they were actually working independently of the ICP in the provision of ongoing bedside care for the dying patients. This can be understood as following: (I) the ICP is not compatible with the complex problems of dying patients; therefore, nurses must tinker with the ICP in order to give dying patients proper and dignified care; (II) the ICP is a myth with symbolic power, legitimizing care makes nurses positive towards the ICP; and (III) using the ICP as a loosely coupled system creates novel effects on nursing practice. In this study, we have shown how the ICP creates a common culture through a process of individual and collective sensemaking, which we labelled clinical mindlines
    corecore