Related papers: Tight limits and completions from Dedekind-MacNeil…
While computer programs and logical theories begin by declaring the concepts of interest, be it as data types or as predicates, network computation does not allow such global declarations, and requires *concept mining* and *concept…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
Many kinds of categorical structure require the existence of finite limits, of colimits of some specified type, and of "exactness" conditions between the finite limits and the specified colimits. Some examples are the notions of regular, or…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
A restriction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of partial maps are restriction categories; conversely, a…
An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these…
Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…
We consider ordered tuples in finite groups generating nilpotent subgroups. Given an integer $q$ we consider the poset of nilpotent subgroups of class less than $q$ and its corresponding coset poset. These posets give rise to a family of…
We show that there are infinitely many distinct closed classes of colimits (in the sense of the Galois connection induced by commutation of limits and colimits in Set) which are intermediate between the class of pseudo-filtered colimits and…
We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given…
Given a monad T on a suitable enriched category B equipped with a proper factorization system (E,M), we define notions of T-completion, T-closure, and T-density. We show that not only the familiar notions of completion, closure, and density…
We consider various notions of completeness in symplectic topology and ask two related questions. Does a complete open symplectic manifold remain complete after excising a subset? Can two sets be made arbitrarily far apart by adjusting the…
We compare the colimit and 2-colimit of strict 2-functors in the 2-category of groupoids, over a certain type of posets. These posets are of special importance, as they correspond to coverings of a topological space. The main result of this…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
This paper develops a theory of colimit sketches "with constructions" in higher category theory, formalising the input to the ubiquitous procedure of adjoining specified "constructible" colimits to a category such that specified "relation"…
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…
We develop a number of basic concepts in the theory of categories internal to an $\infty$-topos. We discuss adjunctions, limits and colimits as well as Kan extensions for internal categories, and we use these results to prove the universal…
A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…
In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model…
We give a definition of thickness in $\mathbb{R}^d$ that is useful even for totally disconnected sets, and prove a Gap Lemma type result. We also guarantee an interval of distances in any direction in thick compact sets, relate thick sets…