Related papers: Concrete categories and higher-order recursion (Wi…
Concrete domains have been introduced in the context of Description Logics to allow references to qualitative and quantitative values. In particular, the class of $\omega$-admissible concrete domains, which includes Allen's interval…
Applied category theory has recently developed libraries for computing with morphisms in interesting categories, while machine learning has developed ways of learning programs in interesting languages. Taking the analogy between categories…
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…
This paper contains results from two areas -- formal theory of Kan extensions and concrete categories. The contribution to the former topic is based on the extension of the concept of Kan extension to the cones and we prove that limiting…
Patterns are fundamental to human cognition, enabling the recognition of structure and regularity across diverse domains. In this work, we focus on structural repeats, patterns that arise from the repetition of hierarchical relations within…
We firstly introduce some key concepts in category theory, such as quotient category, completion of limits, $\mathrm{Mor}$ category, and so on; then give the concept of topology algebras and sheaves, and discuss how to restore the structue…
Fix a scheme $X$ over a field of characteristic zero that is equipped with an action of a reductive algebraic group $G$. We give necessary and sufficient conditions for a $G$-equivariant coherent sheaf on $X$ or a bounded-above complex of…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
If a Quillen model category can be specified using a certain logical syntax (intuitively, ``is algebraic/combinatorial enough''), so that it can be defined in any category of sheaves, then the satisfaction of Quillen's axioms over any site…
We define a higher-order generalisation of the CPM construction based on arbitrary finite abelian group symmetries of symmetric monoidal categories. We show that our new construction is functorial, and that its closure under iteration can…
We introduce and study kernel algebras, i.e., algebras in the category of sheaves on a square of a scheme, where the latter category is equipped with a monoidal structure via a natural convolution operation. We show that many interesting…
In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…
We develop a `universal' support theory for derived categories of constructible (analytic or \'etale) sheaves, holonomic D-modules, mixed Hodge modules and others. As applications we classify such objects up to the tensor triangulated…
In this note we present a work in progress whose main purpose is to establish a categorified version of sheaf theory. We present a notion of derived categorical sheaves, which is a categorified version of the notion of complexes of sheaves…
Freyd categories provide a semantics for first-order effectful programming languages by capturing the two different orders of evaluation for products. We enrich Freyd categories in a duoidal category, which provides a new, third choice of…
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…
We aim to reconstruct a monoid scheme $X$ from the category of quasi-coherent sheaves over it. This is much in the vein of Gabriel's original reconstruction theorem. Under some finiteness condition on a monoid schemes $X$, we show that the…
It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…
This article serves as a preliminary introduction to the design of a new, open-source applied and computational category theory framework, named Categorica, built on top of the Wolfram Language. Categorica allows one to configure and…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…