Related papers: Logical systems I: Lambda calculi through discrete…

We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…

For an arbitrary finite dimensional algebra $\Lambda$, we prove that any wide subcategory of $\mathsf{mod} \Lambda$ satisfying a certain finiteness condition is $\theta$-semistable for some stability condition $\theta$. More generally, we…

Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…

We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories. In the case of bicategories and pseudofunctors, existing…

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…

We extend the classical notion of a Reedy category so as to allow non-trivial automorphisms. Our extension includes many important examples occuring in topology such as Segal's category Gamma, or the total category of a crossed simplicial…

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

We consider a discrete latent variable model for two-way data arrays, which allows one to simultaneously produce clusters along one of the data dimensions (e.g. exchangeable observational units or features) and contiguous groups, or…

This paper proves three different coherence theorems for symmetric monoidal bicategories. First, we show that in a free symmetric monoidal bicategory every diagram of 2-cells commutes. Second, we show that this implies that the free…

The notion of pseudocategory, as considered in [11], is extended from the context of a 2-category to the more general one of a sesquicategory, which is considered as a category equipped with a 2-cell structure. Some particular examples of…

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

Instead of developing a customized typed lambda-calculus for each theory, we attempt to design a general parametric calculus that permits to express the proofs of any theory. This way, the problem of expressing proofs in the lambda-calculus…

We introduce pseudoalgebras for relative pseudomonads and develop their theory. For each relative pseudomonad $T$, we construct a free--forgetful relative pseudoadjunction that exhibits the bicategory of $T$-pseudoalgebras as terminal among…

Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect…

Using a multiple critical points theorem for locally Lipschitz continuous functionals, we establish the existence of at least three distinct solutions for a parametric discrete differential inclusion problem involving a real symmetric and…

Cobordism categories are known to be compact closed. They can therefore be used to define non-degenerate models of multiplicative linear logic by combining the Int construction with double glueing. In this work we detail such construction…

A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…

In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end.

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…