English
Related papers

Related papers: Bicartesian Coherence

200 papers

We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…

Category Theory · Mathematics 2016-12-13 Amit Kuber , Jiří Rosický

Let T be a triangulated category, A a graded abelian category and h: T -> A a homology theory on T with values in A. If the functor h reflects isomorphisms, is full and is such that for any object x in A there is an object X in T with an…

Category Theory · Mathematics 2010-11-01 Teimuraz Pirashvili , Maria Julia Redondo

The question "What is category theory" is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of…

Category Theory · Mathematics 2007-05-23 David Ellerman

By representing the range of fair betting odds according to a pair of confidence set estimators, dual probability measures on parameter space called frequentist posteriors secure the coherence of subjective inference without any prior…

Statistics Theory · Mathematics 2012-05-02 David R. Bickel

The classical Eckmann-Hilton argument shows that two monoid structures on a set, such that one is a homomorphism for the other, coincide and, moreover, the resulting monoid is commutative. This argument immediately gives a proof of the…

Category Theory · Mathematics 2009-07-03 M. A. Batanin

Let $\k$ be a field, and let $A$ and $B$ be connected $\N$-graded $\k$-algebras. The algebra $A$ is said to be a graded right-free extension of $B$ provided there is a surjective graded algebra morphism $\pi: A \to B$ such that $\ker\pi$ is…

Rings and Algebras · Mathematics 2020-06-16 Peter Goetz

Aczel-Mendler bisimulations are a coalgebraic extension of a variety of computational relations between systems. It is usual to assume that the underlying category satisfies some form of the axiom of choice, so that the collection of…

Logic in Computer Science · Computer Science 2025-09-10 Jeremy Dubut

We give a short topological proof of coherence for categorified non-symmetric operads by using the fact that the diagrams involved form the 1-skeleton of simply connected CW complexes. We also obtain a "one-step" topological proof of Mac…

Algebraic Topology · Mathematics 2024-11-01 Pierre-Louis Curien , Guillaume Laplante-Anfossi

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…

Logic in Computer Science · Computer Science 2016-03-27 Stefan Hetzl , Lutz Straßburger

The aim of this paper is twofold. First we prove a theorem of extension of sections of a coherent subquotient of a hermitian vector bundle on a complex analytic space with control of the norms, without any of the smoothness assumptions that…

Number Theory · Mathematics 2007-05-23 Hugues Randriam

It is well-known that the tensor product of two bialgebras constitutes the binary product in the category of cocommutative bialgebras and morphisms of bialgebras between them. In this paper, we extend this result to triangular bialgebras…

Quantum Algebra · Mathematics 2026-05-27 Alessandro Ardizzoni , Andrea Sciandra

Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and…

Category Theory · Mathematics 2009-03-31 Ross Duncan

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \textit{equitability up to one item} (EQ1) and focus on the…

Computer Science and Game Theory · Computer Science 2025-08-22 Hadi Hosseini , Aditi Sethia

We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…

Category Theory · Mathematics 2021-12-14 Matt Wilson , Augustin Vanrietvelde

The aim of the paper is to describe autocompact objects in Ab5-categories, i.e. objects in cocomplete abelian categories with exactness preserving filtered colimits of exact sequences, whose covariant Hom-functor commutes with copowers of…

Category Theory · Mathematics 2021-02-10 Josef Dvořák , Jan Žemlička

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…

Computer Science and Game Theory · Computer Science 2025-07-03 Samuel Bismuth , Ivan Bliznets , Erel Segal-Halevi

We generalize the Pierce representation theorem for (commutative) rings with unit to other algebraic categories with Definable Factor Congruences by using tools from topos theory. Of independent interest, we prove that an algebraic category…

Category Theory · Mathematics 2018-05-21 William Zuluaga

Ehrhard, Pagani and Tasson proposed a model of probabilistic functional programming in a category of normed positive cones and stable measurable cone maps, which can be seen as a coordinate-free generalization of probabilistic coherence…

Logic in Computer Science · Computer Science 2023-06-22 Sergey Slavnov

The term ``Boolean category'' should be used for describing an object that is to categories what a Boolean algebra is to posets. More specifically, a Boolean category should provide the abstract algebraic structure underlying the proofs in…

Logic in Computer Science · Computer Science 2011-11-09 Lutz Strassburger