Related papers: Equ-saturating categories
We study complexes of stable $\infty$-categories, referred to as categorical complexes. As we demonstrate, examples of such complexes arise in a variety of subjects including representation theory, algebraic geometry, symplectic geometry,…
In previous work with J. Hedges, we formalised a generalised quantifiers theory of natural language in categorical compositional distributional semantics with the help of bialgebras. In this paper, we show how quantifier scope ambiguity can…
We describe the ind- and pro- categories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.
We introduce the new notion of quotient-saturation as a measure of the immensity of the quotient structure of a group. We present a sufficient condition for a finitely presented group to be quotient-saturated, and use it to deduce that…
This is a generalization of some results of Ma-Sauter from module categories over artin algebras to more general functor categories (and partly to exact categories). In particular, we generalize the definition of a faithfully balanced…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…
Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…
We establish a Dwyer-Kan equivalence of relative categories of combinatorial model categories, presentable quasicategories, and other models for locally presentable (infinity,1)-categories. This implies that the underlying quasicategories…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…
For a small quantaloid $\mathcal{Q}$, we introduce $\mathcal{M}$-(co)complete $\mathcal{Q}$-categories, i.e., (co)complete $\mathcal{Q}$-categories up to Morita equivalence, as Eilenberg--Moore algebras of the presheaf monad on the category…
To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are…
We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…
We study, in an abstract axiomatic setting, the notion of sectional category of a morphism. From this, we unify and generalize known results about this invariant in different settings as well as we deduce new applications.
A coextensive category can be defined as a category $\mathcal{C}$ with finite products such that for each pair $X,Y$ of objects in $\mathcal{C}$, the canonical functor $\times\colon X/\mathcal{C} \times Y/\mathcal{C} \to (X \times…
Relation classification (RC) aims to predict the relationship between a pair of subject and object in a given context. Recently, prompt tuning approaches have achieved high performance in RC. However, existing prompt tuning approaches have…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
Distributed word representations have been demonstrated to be effective in capturing semantic and syntactic regularities. Unsupervised representation learning from large unlabeled corpora can learn similar representations for those words…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…
We describe a notion of categorical model for unitless fragments of (multiplicative) linear logic. The basic definition uses promonoidal categories, and we also give an equivalent elementary axiomatisation.