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 …

We define a family of intuitionistic non-normal modal logics; they can be seen as intuitionistic
counterparts of classical ones. We first consider monomodal logics, which contain only …

Labelled proof theory has been famously successful for modal logics by mimicking their
relational semantics within deductive systems. Simpson in particular designed a framework …

We define a family of propositional constructive modal logics corresponding each to a
different classical modal system. The logics are defined in the style of Wijesekera's …

In this thesis, we use in two ways the concept of synthetic inference rules that can be
obtained from a focused proof system; from one side of the “telescope”, focusing allows us to …

The key to the proof-theoretic study of a logic is a proof calculus with a subformula property.
Many different proof formalisms have been introduced (eg sequent, nested sequent, labelled …

This paper presents an overview of the methods of nested sequents or treehypersequents
that were originally introduced to provide a comprehensive proof theory for modal logic. The …

This thesis rigorously explores modal logics, analyzing them from a proof theory perspective.
In the intuitionistic setting of modal logics, we present a fully labelled sequent system such …

Modal logics were originally defined in terms of axioms in a Hilbert system, and later in terms
of their semantics in relational structures. Structural proof theory for modal logics, however …

Uniform Interpolation and Admissible Rules: Proof-theoretic investigations into (intuitionistic)
modal logics — University of Birmingham Skip to main navigation Skip to search Skip to main …