DeepAI AI Chat
Log In Sign Up

Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity

by   Tiziano Dalmonte, et al.

We present some hypersequent calculi for all systems of the classical cube and their extensions with axioms T, P, D, and, for every n≥ 1, rule RD^+_n. The calculi are internal as they only employ the language of the logic, plus additional structural connectives. We show that the calculi are complete with respect to the corresponding axiomatisation by a syntactic proof of cut elimination. Then we define a terminating root-first proof search strategy based on the hypersequent calculi and show that it is optimal for coNP-complete logics. Moreover, we obtain that from every saturated leaf of a failed proof it is possible to define a countermodel of the root hypersequent in the bi-neighbourhood semantics, and for regular logics also in the relational semantics. We finish the paper by giving a translation between hypersequent rule applications and derivations in a labelled system for the classical cube.


page 1

page 2

page 3

page 4


Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics

The preferential conditional logic PCL, introduced by Burgess, and its e...

A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic

Extending and generalizing the approach of 2-sequents (Masini, 1992), we...

Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics

This work provides proof-search algorithms and automated counter-model e...

From 2-sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics

We extend to natural deduction the approach of Linear Nested Sequents an...

Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents

We provide a direct method for proving Craig interpolation for a range o...

MacNeille completion and Buchholz' Omega rule for parameter-free second order logics

Buchholz' Omega-rule is a way to give a syntactic, possibly ordinal-free...

A tableau methodology for deontic conditional logics

In this paper we present a theorem proving methodology for a restricted ...