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 …

An important application of focused variants of Gentzen's sequent calculus proof rules is the
construction of (possibly) large synthetic inference rules. This paper examines the synthetic …

Theorem provers produce evidence of proof in many different formats, such as proof scripts,
natural deductions, resolution refutations, Herbrand expansions, and equational rewritings …

We propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of
hypersequents, suitable for automated reasoning via proof search. We show that previously …

We propose a cut-free cyclic system for transitive closure logic (TCL) based on a form of
hypersequents, suitable for automated reasoning via proof search. We show that previously …

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 …

Focusing is a general technique for transforming a sequent proof system into one with a
syntactic separation of non-deterministic choices without sacrificing completeness. This not …

Several deductive formalisms (eg, sequent, nested sequent, labeled sequent, hyperse-quent
calculi) have been used in the literature for the treatment of modal logics, and some …

Abstract The Foundational Proof Certificate (FPC) framework can be used to define the
semantics of a wide range of proof evidence. For example, such definitions exist for a …

In a world where trusting software systems is problematic, formal methods and formal proofs
should be able to help. Proof checking can play an important role in establishing trust since …