Nested Sequents for Intuitionistic Modal Logics via Structural Refinement

@inproceedings{Lyon2021NestedSF,
  title={Nested Sequents for Intuitionistic Modal Logics via Structural Refinement},
  author={Tim Lyon},
  booktitle={TABLEAUX},
  year={2021}
}
  • Tim Lyon
  • Published in TABLEAUX 2021
  • Computer Science, Mathematics
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… Expand

Figures from this paper

References

SHOWING 1-10 OF 34 REFERENCES
Deep sequent systems for modal logic
TLDR
A systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5, which stay very close to Gentzen’s sequent calculus. Expand
MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
TLDR
To the authors' knowledge, this is the first automated theorem prover for intuitionistic modal logics based on nested sequent proof systems and implemented single-conclusion systems and multi-conclusions systems for all logics in the intuitionisticModal IS5-cube. Expand
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents
TLDR
This work provides a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality, and a novel feature of the proof includes an orthogonality condition for defining duality between interpolants. Expand
Refining Labelled Systems for Modal and Constructive Logics with Applications
  • Tim Lyon
  • Computer Science, Mathematics
  • ArXiv
  • 2021
This thesis introduces the"method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system byExpand
On the correspondence between nested calculi and semantic systems for intuitionistic logics
  • Tim Lyon
  • Computer Science, Mathematics
  • J. Log. Comput.
  • 2021
TLDR
The method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favorable properties are derived directly from a logic’s semantics. Expand
Label-free natural deduction systems for intuitionistic and classical modal logics
TLDR
A new multi-contextual structure is introduced, called T-sequent, that allows to design simple labelfree natural deduction systems for these logics that satisfy the normalization property and consequently the subformula property in the intuitionistic case. Expand
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
We present cut-free deductive systems without labels for the intuitionistic variants of the modal logics obtained by extending IK with a subset of the axioms d, t, b, 4, and 5. For this, we use theExpand
Tree-sequent calculi and decision procedures for intuitionistic modal logics
TLDR
This article defines label-free sequent calculi for the intuitionistic modal logics obtained from the combinations of the axioms T, B, 4 and 5 based on a multi-contextual sequent structure, called Tree-sequent. Expand
Label-free Modular Systems for Classical and Intuitionistic Modal Logics
In this paper we show for each of the modal axioms d, t, b, 4, and 5 an equivalent set of inference rules in a nested sequent system, such that, when added to the basic system for the modal logic K,Expand
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
TLDR
It is shown that, for a range of extensions of tense logic, the two styles of calculi are equivalent, and there is a natural proof theoretic correspondence between display postulates and deep inference. Expand
...
1
2
3
4
...