The present article aims at establishing formal connections between correspondence
phenomena, well known from the area of modal logic, and the theory of display calculi …

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 …

We provide a direct method for proving Craig interpolation for a range of modal and
intuitionistic logics, including those containing a" converse" modality. We demonstrate this …

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 …

This work provides proof-search algorithms and automated counter-model extraction for a
class of STIT logics. With this, we answer an open problem concerning syntactic decision …

What can (and cannot) be expressed by structural display rules? Given a display calculus,
we present a systematic procedure for transforming axioms into structural rules. The …

This paper presents an overview of the methods of hypersequents and display sequents in
the proof theory of non-classical logics. In contrast with existing surveys dedicated to …

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms
are generated from a formal grammar. We consider a proof theory, in nested sequent …

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 …

We introduce translations between display calculus proofs and labeled calculus proofs in
the context of tense logics. First, we show that every derivation in the display calculus for the …