Related papers: Effective descent morphisms of filtered preorders

We present a characterization of effective descent morphisms in the lax comma category $\mathsf{Ord}//X$ when $X$ is a locally complete ordered set, as well as in the antisymmetric setting.

Let $\mathsf{Ord} $ be the category of (pre)ordered sets. Unlike $\mathsf{Ord}/X$, whose behaviour is well-known, not much can be found in the literature about the lax comma 2-category $\mathsf{Ord} //X$. In this paper we show that the…

Effective descent morphisms, originally defined in Grothendieck descent theory, form a class of special morphisms within a category. Essentially, an effective descent morphism enables bundles over its codomain to be fully described as…

This paper investigates the interplay between properties of a topological space $X$, in particular of its natural order, and properties of the lax comma category $\mathsf{Top} \Downarrow X$, where $\mathsf{Top}$ denotes the category of…

We give sufficient conditions for effective descent in categories of (generalized) internal multicategories. Two approaches to study effective descent morphisms are pursued. The first one relies on establishing the category of internal…

Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…

Let $A$ be a regular category with pushouts of regular epimorphisms by regular epimorphism and $Reg(A)$ the category of regular epimorphisms in $A$. We prove that every regular epimorphism in $Reg(A)$ is an effective descent morphism if,…

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

This thesis is an exposition of the author's contribution on effective descent morphisms in various categories of generalized categorical structures. It consists of: Chapter 1, where an elementary description of descent theory and the…

We study effective descent $ \mathcal V $-functors for cartesian monoidal categories $ \mathcal V $ with finite limits. This study is carried out via the properties enjoyed by the $2$-functor $ \mathcal V \mapsto \mathsf{Fam}(\mathcal V) $,…

We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) ->…

Progressive filtering is a simple way to perform hierarchical classification, inspired by the behavior that most humans put into practice while attempting to categorize an item according to an underlying taxonomy. Each node of the taxonomy…

We give a valuative criterion for when a smooth algebraic stack with a separated good moduli space is the quotient of a separated Deligne-Mumford stack by a torus. For doing so, we introduce a new class of morphisms, the so-called effective…

We define the notion of an indexed profunctor over a 2-category, and use it to develop an abstract theory of limits. The theory subsumes (conical) limits, weighted limits, ends and Kan extensions. Results include an abstract version of the…

By a closure space we will mean a pair $(A,\mathcal{C})$, in which $A$ is a set and $\mathcal{C}$ a set of subsets of $A$ closed under arbitrary intersections. The purpose of this paper is to initiate a development of descent theory of…

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

It is a consequence of the axiom of choice that every preorder can be extended to a total preorder while respecting the strict preorder relation. We call such an extension a prelinearization of the preorder and study the extent to which the…

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

We investigate lifted inference on ordered domains with predecessor relations, where the elements of the domain respect a total (cyclic) order, and every element has a distinct (clockwise) predecessor. Previous work has explored this…