Related papers: Bicartesian Coherence

There are a dozen definitions of weak higher categories, all of which loosen the notion of composition of arrows. A new approach is presented here, where instead the notion of identity arrow is weakened -- these are tentatively called fair…

Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…

We investigate categories in which products distribute over coproducts, a structure we call doubly-infinitary distributive categories. Through a range of examples, we explore how this notion relates to established concepts such as…

We propose here a transcendantal proof of the coherence of the higher direct images of a coherent sheaf by a proper morphism of algebraic varieties, which does not use Chow's lemma nor any projective method. The main tool here are…

We prove that every locally Cartesian closed $\infty$-category with subobject classifier has a strict initial object and disjoint and universal binary coproducts.

We show that the category of corings over a fixed base ring with local units is equivalent to the category of comonads in (right) unital modules whose underlying functors preserve inductive limits. Changing base rings, we prove a…

We extend the usual definition of coherence, for modules over rings, to partially ordered right modules over a large class of partially ordered rings, called po-rings. In this situation, coherence is equivalent to saying that solution…

A double category of relations is essentially a cartesian equipment with strong, discrete and functorial tabulators and for which certain local products satisfy a Frobenius Law. A double category of relations is equivalent to a double…

This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…

Elaboration-based type class resolution, as found in languages like Haskell, Mercury and PureScript, is generally nondeterministic: there can be multiple ways to satisfy a wanted constraint in terms of global instances and locally given…

The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…

A concise guide to very basic bicategory theory, from the definition of a bicategory to the coherence theorem.

Type classes are one of Haskell's most popular features and extend its type system with ad-hoc polymorphism. Since their conception, there were useful features that could not be offered because of the desire to offer two correctness…

We give a definition of a coherent adjunction in a $4$-category consisting of a finite list of $k$-morphisms for $k\leq 4$, plus equations beetween $4$-morphisms. We prove that the restriction map from the space of coherent adjunctions in a…

We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…

The definition of accessible coherence is proposed. Through local measurement on the other subsystem and one way classical communication, a subsystem can access more coherence than the coherence of its density matrix. Based on the local…

We prove that a (lax) bilimit of a 2-functor is characterized by the existence of a limiting contraction in the 2-category of (lax) cones over the diagram. We also investigate the notion of bifinal object and prove that a (lax) bilimit is a…

Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…

We prove Steinebrunner's conjecture on the biequivalence between (colored) properads and labelled cospan categories. The main part of the work is to establish a 1-categorical, strict version of the conjecture, showing that the category of…