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 explore the design of sequent calculi operating on graphs. For this purpose,
we introduce logical connectives allowing us to extend the well-known correspondence …

A linear inference is a valid inequality of Boolean algebra in which each variable occurs at
most once on each side. Equivalently, it is a linear rewrite rule on Boolean terms that …

In this paper we explore the design of sequent calculi operating on graphs. For this purpose,
we introduce a set of logical connectives allowing us to extend the correspondence between …

In the logic programming paradigm, a program is defined by a set of methods, each of which
can be executed when specific conditions are met during the current state of an execution …

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 …

A linear inference is a valid inequality of Boolean algebra in which each variable occurs at
most once on each side. In this work we leverage recently developed graphical …

In theoretical computer science, formulas are used to describe complex structures using
elementary operators such as logical connectives and modalities. In particular, the proof …