Abstract. D.V. Chudnovsky and G.V. Chudnovsky [CH] introduced a generalization of the FrobeniusStickelberger determinantal identity involving elliptic functions that generalize the...
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Abstract. We define a notion of symmetric monoidal closed (smc) theory, consisting of a smc signature augmented with equations, and describe the classifying categories of such theo...
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...