Switch to: References

Add citations

You must login to add citations.
  1. From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2013 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 120 - 139.
    We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Proof Theory for Modal Logic.Sara Negri - 2011 - Philosophy Compass 6 (8):523-538.
    The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer perspective.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • A Hypersequent Solution to the Inferentialist Problem of Modality.Andrew Parisi - 2022 - Erkenntnis 87 (4):1605-1633.
    The standard inferentialist approaches to modal logic tend to suffer from not being able to uniquely characterize the modal operators, require that introduction and elimination rules be interdefined, or rely on the introduction of possible-world like indexes into the object language itself. In this paper I introduce a hypersequent calculus that is flexible enough to capture many of the standard modal logics and does not suffer from the above problems. It is therefore an ideal candidate to underwrite an inferentialist theory (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Omega-inconsistency without cuts and nonstandard models.Andreas Fjellstad - 2016 - Australasian Journal of Logic 13 (5).
    This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a predicate, proves omega-inconsistency (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Labelled Tree Sequents, Tree Hypersequents and Nested Sequents.Rajeev Goré & Revantha Ramanayake - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 279-299.
    Download  
     
    Export citation  
     
    Bookmark   3 citations