We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
We show that short bounded-depth Frege proofs of matrix identities, such as P Q = I QP = I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonho...
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally foun...