Relational Hypersequents for Modal Logics

05/23/2018
by   Samara Burns, et al.
0

We investigate a new approach to modal hypersequents, called relational hypersequents, which incorporates an accessibility relation along the hypersequent. These systems are an adaptation of Restall's 2009 cut-free complete hypersequent system for S5. Variation between modal systems in the relational framework occurs only in the presence or absence of structural rules, which conforms to Došen's principle. All systems are modular except for that of S5. We provide the first cut-free completeness result for K, T, and D, and show how this method fails in the case of B and S4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2019

Appendix for: Cut-free Calculi and Relational Semantics for Temporal STIT logics

This paper is an appendix to the paper "Cut-free Calculi and Relational ...
research
08/27/2021

Relational Hypersequent S4 and B are Cut-Free Hypersequent Incomplete

We show that relational hypersequent K4, S4, KB and RB, investigated in ...
research
04/22/2019

Cut-free Calculi and Relational Semantics for Temporal STIT Logics

We present cut-free labelled sequent calculi for a central formalism in ...
research
07/05/2021

Nested Sequents for Intuitionistic Modal Logics via Structural Refinement

We employ a recently developed methodology – called "structural refineme...
research
10/03/2022

Nested Sequents for First-Order Modal Logics via Reachability Rules

We introduce (cut-free) nested sequent systems for first-order modal log...
research
01/27/2021

Alignment Completeness for Relational Hoare Logics

Relational Hoare logics (RHL) provide rules for reasoning about relation...
research
07/19/2023

Alignment complete relational Hoare logics for some and all

In relational verification, judicious alignment of computational steps f...

Please sign up or login with your details

Forgot password? Click here to reset