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 …

We present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric semantics of
intuitionistic logic based on the principles of the second author's classical Combinatorial …

We introduce subatomic proof theory, a new methodology where, by looking inside atoms,
we are able to represent a wide variety of proof systems in such a way that every rule is an …

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 …

The main part of a classical combinatorial proof is a skew fibration, which precisely captures
the behavior of weakening and contraction. Relaxing the presence of these two rules leads …

This article explores the proof theory necessary for recommending an expressive but
decidable first-order system, named MAV1, featuring a De Morgan dual pair of nominal …

The main contribution of this thesis is to present a study of two normalisation theorems and
proofs in classical logic: one propositional, one first-order. For propositional logic, we show a …

We introduce combinatorial flows as a graphical representation of proofs. They can be seen
as a generalization of atomic flows on one side and of combinatorial proofs on the other …

The reduction of undecidable first-order logic to decidable propositional logic via Herbrand's
theorem has long been of interest to theoretical computer science, with the notion of a …

The reduction of undecidable first-order logic to decidable propositional logic via Herbrand's
theorem has long been of interest to theoretical computer science, with the notion of a …