Negation is in the first place a phenomenon of semantic opposition. As such, negation
relates an expression\(e\) to another expression with a meaning that is in some way …

In this work, we explore proof theoretical connections between sequent, nested and labelled
calculi. In particular, we show a semantical characterisation of intuitionistic, normal and non …

In this work, we investigate the proof theoretic connections between sequent and nested
proof calculi. Specifically, we identify general conditions under which a nested calculus can …

This paper develops an algorithmic-based approach for proving inductive properties of
propositional sequent systems such as admissibility, invertibility, cut-admissibility, and …

The present study shows how to enrich De Morgan algebras with a perfection operator that
allows one to express the Boolean properties of negation-consistency and negation …

General and effective methods are required for providing good automation strategies to
prove properties of sequent systems. Structural properties such as admissibility, invertibility …

A theory of substructural negations as impossibility and as unnecessity based on bi-
intuitionistic logic, also known as Heyting-Brouwer logic, has been developed by Takuro …

The aim of the paper is to present some non-standard modalities (such as non-contingency,
contingency, essence and accident) based on S5-models in a framework of cut-free …

This piece threads substructurality and modality into a negation that activates the downside
of equivalence and identity in a fibrational framework. The piece is a working through of …

Modal logic is usually formulated in a language containing a necessity operator (denoted as
D) and/or possibility operator (denoted as 0). 1 However, in the literature one may find other …