Proof nets for MLL (unit-free multiplicative linear logic) and ALL (unit-free additive linear
logic) are graphical abstractions of proofs which are efficient (proofs translate in linear time) …

This study is concerned with the equality of proofs and formulas in linear logic, with in
particular contributions for the multiplicative-additive fragment of this logic. In linear logic …

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the
usage of the structural inference rules of weakening and contraction. With this, atoms of the …

In this paper, we introduce the notion of expansion tree for linear logic. As in Miller's original
work, we have a shallow reading of an expansion tree that corresponds to the conclusion of …

We propose new sequent calculus systems for orthologic (also known as minimal quantum
logic) which satisfy the cut elimination property. The first one is a simple system relying on …

We present canonical proof nets for first-order additive linear logic, the fragment of linear
logic with sum, product, and first-order universal and existential quantification. We present …

Our solution is to define a notion of combinatorial proof for intuitionistic propositional
sequent calculus. Combinatorial proofs were introduced as a syntax-free reformulation of …

Building on the work done by Heijltjes & Hughes (2015), we investigate proof search in
Classical Logic (CL) through Additive Linear Logic (ALL). The process we investigate, called …

As 24th problem in my Paris lecture, I wanted to ask the question: Find criteria of simplicity or
rather prove the greatest simplicity of given proofs. More generally develop a theory of proof …

Attack trees provide a structure to an attack scenario, where disjunctions represent choices
decomposing attacker's goals into smaller subgoals. This paper investigates the nature of …