Nested Sequents for Intuitionistic Modal Logics via Structural Refinement

07/05/2021
by   Tim S. Lyon, et al.
0

We employ a recently developed methodology – called "structural refinement" – to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
10/31/2022

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement

Intuitionistic grammar logics fuse constructive and multi-modal reasonin...
research
07/23/2020

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...
research
02/13/2018

Proof systems: from nestings to sequents and back

In this work, we explore proof theoretical connections between sequent, ...
research
04/19/2021

On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics

This paper studies the relationship between labelled and nested calculi ...
research
06/13/2023

Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics

We present nested sequent systems for propositional Gödel-Dummett logic ...
research
05/23/2018

Relational Hypersequents for Modal Logics

We investigate a new approach to modal hypersequents, called relational ...

Please sign up or login with your details

Forgot password? Click here to reset