Relational Hypersequent S4 and B are Cut-Free Hypersequent Incomplete

08/27/2021
by   Kai Tanter, et al.
0

We show that relational hypersequent K4, S4, KB and RB, investigated in Parisi (2020) and Burns and Zach (2020) are cut-free hypersequent incomplete. In addition, the former two are also cut-free sequent and formula incomplete.

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
07/09/2018

Cut-off Theorems for the PV-model

We prove cut-off results for deadlocks and serializability of a PV-threa...
research
04/24/2022

A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions

In a previous work, we developed an algorithm for the computation of inc...
research
05/23/2018

Relational Hypersequents for Modal Logics

We investigate a new approach to modal hypersequents, called relational ...
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
08/09/2020

The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them

In sequent calculi, cut elimination is a property that guarantees that a...
research
06/19/2018

Approximation Strategies for Incomplete MaxSAT

Incomplete MaxSAT solving aims to quickly find a solution that attempts ...

Please sign up or login with your details

Forgot password? Click here to reset