In this work, we explore the connections between (linear) nested sequent calculi and
ordinary sequent calculi for normal and non-normal modal logics. By proposing local …

We introduce the framework of linear nested sequent calculi by restricting nested sequents
to linear structures. We show the close connection between this framework and that of 2 …

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 …

Proofs and countermodels are the two sides of completeness proofs, but, in general, failure
to find one does not automatically give the other. The limitation is encountered also for …

This paper studies the relationship between labelled and nested calculi for propositional
intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order …

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 …

We propose a notion of focusing for nested sequent calculi for modal logics which brings
down the complexity of proof search to that of the corresponding sequent calculi. The …

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective
dual to implication usually called 'exclusion'. A standard-style sequent calculus for this logic …

It is well known that context dependent logical rules can be problematic both to implement
and reason about. This is one of the factors driving the quest for better behaved, ie, local …

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 …