Combinatorial proofs form a syntax-independent presentation of proofs, originally proposed
by Hughes for classical propositional logic. In this paper we present a notion of …

We uncover a close relationship between combinatorial and syntactic proofs for first-order
logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system …

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 …

In this paper we extend Hughes' combinatorial proofs to modal logics. The crucial ingredient
for modeling the modalities is the use of a self-dual non-commutative operator that has first …

In this paper we provide two new semantics for proofs in the constructive modal logics CK
and CD. The first semantics is given by extending the syntax of combinatorial proofs for …

Handsome proof nets were introduced by Retor\'e as a syntax for multiplicative linear logic.
These proof nets are defined by means of cographs (graphs representing formulas) …

In this paper, we establish the foundations of a novel logical framework for the 𝜋-calculus,
based on the deduction-as-computation paradigm. Following the standard proof-theoretic …

Using the tools developed to formalize combinatorial proofs for modal logic, in this paper we
extend Retoré's handsome proof nets to multiplicative linear logic with units and …

Proof theory is the branch of logic studying proofs as mathematical objects and it plays an
important role in many areas of computer science. The proof theory has seen enormous …

We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the
simplytyped lambda-calculus. We prove confluence and strong normalization. Combinatorial …