Logical time is a partial order over events in distributed systems, constraining which events
precede others. Special interest has been given to series-parallel orders since they …

In this paper we present a proof system that operates on graphs instead of formulas. We
begin our quest with the well-known correspondence between formulas and cographs …

The course will give a basic introduction to deep inference, which is a design principle for
proof formalisms in which inference rules can be applied at any depth inside the proof. In …

In this paper we present a proof system that operates on graphs instead of formulas. Starting
from the well-known relationship between formulas and cographs, we drop the cograph …

This paper lays down a novel foundation for a proof theory of formulae modelling concurrent
27 processes with mixed probabilistic and non-deterministic choice. Probabilistic choices …

We introduce a novel approach to studying properties of processes in the {\pi}-calculus
based on a processes-as-formulas interpretation, by establishing a correspondence …

Pomset logic and BV are both logics that extend multiplicative linear logic (with mix) with a
third connective that is self-dual and non-commutative. Whereas pomset logic originates …

Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a
third connective that is self-dual and non-commutative. Whereas pomset logic originates …

Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a
third connective that is self-dual and non-commutative. Whereas pomset logic originates …

Pomset logic and BV are both logics that extend multiplicative linear logic (with mix) with a
third connective that is self-dual and non-commutative. Whereas pomset logic originates …