Related papers: Unifying exact completions
Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…
Let X be a smooth variety over a perfect field of characteristic p>0. In this small note we define overconvergent F-de Rham-Witt connections as an analogue for F-crystals over proper schemes. We prove that the forgetful functor from the…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
We demonstrate equivalence between two definitions of lower finite highest weight categories. We also show that, in the presence of a duality, a lower finite highest weight structure on a category is unique. Finally, we give a new proof for…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
The postulates of comprehension and extensionality in set theory are based on an inversion principle connecting set-theoretic abstraction and the property of having a member. An exactly analogous inversion principle connects functional…
We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…
We make explicit the correspondence between syntax and syntactic categories for coherent first-order logic, providing a categorical characterization of bi-interpretability. This is done by creating a biequivalence between a bicategory of…
We present an overview of the notions of exact sequences of Hopf algebras and tensor categories and their connections. We also present some examples illustrating their main features; these include simple fusion categories and a natural…
We define admissible and weakly admissible subcategories in exact categories and prove that the former induce semi-orthogonal decompositions on the derived categories. We develop the theory of thin exact categories, an exact-category…
We define fully exact module categories, a subclass of exact module categories over a finite braided tensor category that is stable under the relative Deligne product. In contrast, we demonstrate with examples in both zero and non-zero…
Adhesive categories are categories which have pushouts with one leg a monomorphism, all pullbacks, and certain exactness conditions relating these pushouts and pullbacks. We give a new proof of the fact that every topos is adhesive. We also…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
Suppose $(\mathcal{C},\mathbb{E},\mathfrak{s})$ is an $n$-exangulated category. We show that the idempotent completion and the weak idempotent completion of $\mathcal{C}$ are again $n$-exangulated categories. Furthermore, we also show that…
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
The effective properties of composites and review literature on the methods of Rayleigh, Natanzon--Filshtinsky, functional equations and asymptotic approaches are outlined. In connection with the above methods and new recent publications…
In this paper we investigate the categories of braided objects, algebras and bialgebras in a given monoidal category, some pairs of adjoint functors between them and their relations. In particular we construct a braided primitive functor…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
Everyone knows that if you have a bivariant homology theory satisfying a base change formula, you get an representation of a category of correspondences. For theories in which the covariant and contravariant transfer maps are in mutual…
We show that either of the two reasonable choices for the category of compact quantum groups is nice enough to allow for a plethora of universal constructions, all obtained "by abstract nonsense" via the adjoint functor theorem. This…