We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly
terminating backward proof search for the intuitionistic Strong Löb logic, an intuitionistic …

The uniform interpolation property in a given logic can be understood as the definability of
propositional quantifiers. We mechanise the computation of these quantifiers and prove …

The key strength of preference-based logics for conditional obligation is their ability to
handle contrary-to-duty paradoxes and account for exceptions. Here we investigate Åqvist's …

Artemov and Protopopescu proposed intuitionistic epistemic logic (IEL) to capture an
intuitionistic conception of knowledge. By establishing completeness, they provided the …

New Foundations for the Proof Theory of Bi-Intuitionistic and Provability Logics Mechanized in
Coq Page 1 New Foundations for the Proof Theory of Bi-Intuitionistic and Provability Logics …

Recently, van der Giessen and Iemhoff proved cut-admissibility for the sequent calculus
GL4ip for propositional intuitionistic provability logic. To do so, they were forced to use an …

Artemov and Protopopescu proposed intuitionistic epistemic logic (IEL) to capture an
intuitionistic conception of knowledge. By establishing completeness, they provided the …

The logic of bunched implications (BI) is a substructural logic that forms the backbone of
separation logic, the much studied logic for reasoning about heap-manipulating programs …

Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in
which one can define schemas for reasoning steps and manipulate proofs as a …

In 1984, Wim Ruitenburg published a surprising result about periodic sequences in
intuitionistic propositional calculus (IPC). The property established by Ruitenburg naturally …