Every language recognized by the Lambek calculus with brackets is context-free. This is shown by combining an observation by Jäger with an entirely straightforward adaptation of the method Pentus used for the original Lambek calculus. The case of the variant of the calculus allowing sequents with empty antecedents is slightly more complicated, requiring a restricted use of the multiplicative unit.

This paper is included in a series aiming to contribute to the algebraic theory of distributed computation. The key problem in understanding Multi-Agent Systems is to find a theory which integrates the reactive part and the control part of such systems. To this end we use the calculus of flownomials. It is a polynomial-like calculus for representing flowgraphs and their behaviours. An ‘additive...

This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension fields essentially decomposes as a product of algebraic tori, whose properties allow for improved communication efficiency. Part I of this thesis ...

We add branching time to the linear discrete event calculus, which yields a formalism for commonsense reasoning that combines the benefits of the situation calculus and the event calculus. We characterize the precise relationship between the linear and branching versions of the discrete event calculus, and prove that a restricted version of the branching discrete event calculus is equivalent to...

We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin’s system for the intuitionistic case. The calculus has the nonlinear and linear implications as the basic constructs, and this design choice allows a technically managable axiomatization without commuting conversions. Despite this simplicity, the calculus is show...

We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a sequent calculus proof simply by properly adding to it some special edges, called sequential edges, which express the sequentiality constraints given by sequent calculus. © 2008 Elsevier B.V. All rights reserved.

We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L∗ the derivability problem is NP-complete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NP-complete.