Related papers: Logical Structure on Inverse Functor Categories
Inverse categories are categories in which every morphism x has a unique pseudo-inverse y in the sense that xyx=x and yxy=y. Persistence modules from topological data analysis and similarly decomposable category representations factor…
The cartesian structure possessed by relations, spans, profunctors, and other such morphisms is elegantly expressed by universal properties in double categories. Though cartesian double categories were inspired in part by the older program…
We establish a sufficient condition for the category of homotopical inverse diagrams to be closed under pushforward inside the category of inverse diagrams in a fibration category.
Locally cartesian closed (lcc) categories are natural categorical models of extensional dependent type theory. This paper introduces the "gros" semantics in the category of lcc categories: Instead of constructing an interpretation in a…
Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
This paper is a submission to the contest: How to combine logics? at the World Congress and School on Universal Logic III, 2010. We claim that combining "things", whatever these things are, is made easier if these things can be seen as the…
Cognitive studies and artificial intelligence have developed distinct models for various inferential mechanisms (categorization, induction, abduction, causal inference, contrast, merge, ...). Yet, both natural and artificial views on…
In [BaSc2] the authors introduced a much weaker homotopical structure than a model category, called a "weak cofibration category". We further showed that a small weak cofibration category induces in a natural way a model category structure…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…
We show that the free construction from multicategories to permutative categories is a categorically-enriched non-symmetric multifunctor. Our main result then shows that the induced functor between categories of algebras is an equivalence…
The fundamental challenge in causal induction is to infer the underlying graph structure given observational and/or interventional data. Most existing causal induction algorithms operate by generating candidate graphs and evaluating them…
A common technique for producing a new model category structure is to lift the fibrations and weak equivalences of an existing model structure along a right adjoint. Formally dual but technically much harder is to lift the cofibrations and…
Analogy is a central faculty of human intelligence, enabling abstract patterns discovered in one domain to be applied to another. Despite its central role in cognition, the mechanisms by which Transformers acquire and implement analogical…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
We construct combinatorial model category structures on the categories of (marked) categories and (marked) pre-additive categories, and we characterize (marked) additive categories as fibrant objects in a Bousfield localization of…
We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…
If $D$ is a Reedy category and $M$ is a model category, the category $M^{D}$ of $D$-diagrams in $M$ is a model category under the Reedy model category structure. If $C \to D$ is a Reedy functor between Reedy categories, then there is an…
Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the…