Related papers: Exact completion and constructive theories of sets
Let $\mathbf{C}$ be a Cauchy-complete category. The subtoposes of $[\mathbf{C}^{\mathrm{op}},\mathbf{Set}]$ are sometimes all of the form $[\mathbf{D}^{\mathrm{op}},\mathbf{Set}]$ where $\mathbf{D}$ is a full subcategory of $\mathbf{C}$.…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
Characterizations of paracompact finite $C$-spaces via continuous selections are given. We apply these results to obtain some properties of finite $C$-spaces. Factorization theorems and a completion theorem for finite $C$- spaces are also…
We develop a completion theory for (general) non-Archimedean spaces based on the theory on "a categorical concept of completion of objects" as introduced by G.C.L. Br\"ummer and E. Giuli. Our context is the construct $\mathbf{NA}_0$ of all…
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…
By introducing the concept of quantaloidal completions for an order-enriched category, relationships between the category of quantaloids and the category of order-enriched categories are studied. It is proved that quantaloidal completions…
We propose the design of novel categorical generative AI architectures (GAIAs) using topos theory, a type of category that is ``set-like": a topos has all (co)limits, is Cartesian closed, and has a subobject classifier. Previous theoretical…
This paper is the first part of a series that investigates the existence of $n$-exact structures on idempotent complete additive categories for positive integers $n$. It is shown that every idempotent complete additive category has a unique…
We introduce the notions of proto-complete, complete, complete* and strong-complete objects in pointed categories. We show under mild conditions on a pointed exact protomodular category that every proto-complete (respectively complete)…
First, we define some concepts similar to the local compactoidity or the c-compactness, and study relationships between these concepts and the original ones. As a result, we find a characterization of the local compactoidity when its…
We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…
It is consistent with constructive set theory (without Countable Choice, clearly) that the Cauchy reals (equivalence classes of Cauchy sequences of rationals) are not Cauchy complete. Related results are also shown, such as that a Cauchy…
We study completions of Archimedean vector lattices relative to any nonempty set of positively-homogeneous functions on finite-dimensional real vector spaces. Examples of such completions include square mean closed and geometric closed…
We prove the (2,1)-categorical analogue of the small object argument and give a (2,1)-model structure on the category of small coherent categories, coherent functors and natural isomorphisms. It is induced by a higher dimensional example of…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
We construct classifying spaces for discrete and compact Lie groups, with the property that they are topological groups and complete metric spaces in a natural way. We sketch a program in view of extending these constructions.
We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…
In this paper, based on results of exact learning and test theory, we study arbitrary infinite binary information systems each of which consists of an infinite set of elements and an infinite set of two-valued functions (attributes) defined…
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…
In the first part, we further advance the study of category theory in a strong balanced factorization category C [Pisani, 2008], a finitely complete category endowed with two reciprocally stable factorization systems such that X \to 1 is in…