相关论文: Coherence of Proof-Net Categories

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…

Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the…

We study the monoidal closed category of symmetric multicategories, especially in relation with its cartesian structure and with sequential multicategories (whose arrows are sequences of concurrent arrows in a given category). Then we…

Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…

In this paper, we develop the proof theory of skew prounital closed categories. These are variants of the skew closed categories of Street where the unit is not represented. Skew closed categories in turn are a weakening of the closed…

We present an unbiased theory of symmetric multicategories, where sequences are replaced by families. To be effective, this approach requires an explicit consideration of indexing and reindexing of objects and arrows, handled by the double…

The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…

Many real-world applications give rise to large heterogeneous networks where nodes and edges can be of any arbitrary type (e.g., user, web page, location). Special cases of such heterogeneous graphs include homogeneous graphs, bipartite,…

We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…

We prove that the homotopy theory of parsummable categories (as defined by Schwede) with respect to the underlying equivalences of categories is equivalent to the usual homotopy theory of symmetric monoidal categories. In particular, this…

Coding theory is very useful for real world applications. A notable example is digital television. Basically, coding theory is to study a way of detecting and/or correcting data that may be true or false. Moreover coding theory is an area…

We study a resource-sensitive fragment of the problem of extracting a logical discipline from a class of neural architectures by passing through categorization. The starting point is not a pre-existing logic but a category of zone-labelled…

In this paper, we state and prove precise theorems on the classification of the category of (braided) categorical groups and their (braided) monoidal functors, and some applications obtained from the basic studies on monoidal functors…

In this dissertation, we compare the "classical" homology of an $\omega$-category (defined as the homology of its Street nerve) with its polygraphic homology. More precisely, we prove that both homologies generally do not coincide and call…

We develop a theory of adjunctions in semigroup categories, i.e. monoidal categories without a unit object. We show that a rigid semigroup category is promonoidal, and thus one can naturally adjoin a unit object to it. This extends the…

We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…

In this article we investigate which categorical structures of a category C are inherited by its arrow category. In particular, we show that a monoidal equivalence between two categories gives rise to a monoidal equivalence between their…

A theory graph is a network of axiomatic theories connected with meaning-preserving mappings called theory morphisms. Theory graphs are well suited for organizing large bodies of mathematical knowledge. Traditional and formal proofs do not…