Related papers: Constructing Span Categories From Categories Witho…
Functional ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions. For independent features, this decomposition is well-defined, strongly linked with SHAP…
The growing complexity of modern practical problems puts high demands on the mathematical modelling. Given that various models can be used for modelling one physical phenomenon, the role of model comparison and model choice becomes…
Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
In this paper, we define the pullback crossed modules in the category of racks which mainly based on a pullback diagram of rack morphisms with extra crossed module data on some of its arrows. Furthermore we prove that the conjugation…
The paper defines polynomials in a bicategory $\mathscr{M}$. Polynomials in bicategories $\mathrm{Spn}\mathscr{C} \ $ of spans in a finitely complete category $\mathscr{C} \ $ agree with polynomials in $\mathscr{C} \ $ as defined by Nicola…
We introduce rigid algebras, a generalization of rigid categories to arbitrary symmetric monoidal $(\infty,2)$-categories. We develop their general theory, showing in particular that the a priori $(\infty,2)$-category of rigid algebras is…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
One of the major advantages of $\infty$-category theory over classical $1$-category theory is its robust and homotopically meaningful framework for taking (co)limits of diagrams of $\infty$-categories. However, it is both subtle and crucial…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
Recent advances in programming languages study and design have established a standard way of grounding computational systems representation in category theory. These formal results led to a better understanding of issues of control and…
The category ${\rm Rel}(\mathcal{C})$ may be formed for any category $\mathcal{C}$ with finite limits using the same objects as $\mathcal{C}$ but whose morphisms from $X$ to $Y$ are binary relations in $\mathcal{C}$, that is, subobjects of…
Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…
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…
We modularly build increasingly larger fragments of the ZX-calculus by modularly adding new generators and relations, at each point, giving some concrete semantics in terms of some category of spans. This is performed using Lack's technique…
Derivations provide a way of transporting ideas from the calculus of manifolds to algebraic settings where there is no sensible notion of limit. In this paper, we consider derivations in certain monoidal categories, called codifferential…
Variables are a crucial element in logic and are also addressed in institution theory, an effort to axiomatize logic. In institution theory, we typically use extensions (signature morphisms) obtained from variables instead of introducing…
The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…
We characterize $t$-structures in stable $\infty$-categories as suitable quasicategorical factorization systems. More precisely we show that a $t$-structure $\mathfrak{t}$ on a stable $\infty$-category $\mathbf{C}$ is equivalent to a normal…
We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…