English
Related papers

Related papers: Realization of relational presheaves

200 papers

A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…

Category Theory · Mathematics 2015-01-29 Joaquín Díaz Boils

We give a general method to build categories of combinatorial manifolds, i.e. categories of combinatorial objects satisfying some local property at every "point", as coreflective subcategories of categories of relational presheaves. To do…

Category Theory · Mathematics 2026-05-21 Yorgo Chamoun

We generalize the concepts of locally presentable and accessible categories. Our framework includes such categories as small presheaves over large categories and ind-categories. This generalization is intended for applications in the…

Category Theory · Mathematics 2012-06-05 Boris Chorny , Jiri Rosicky

We investigate Riguet congruences and generalized congruences on a category, focusing on their interrelations from both lattice-theoretic and category-theoretic perspectives. We also characterize functors that are full and surjective on…

Category Theory · Mathematics 2026-05-21 Juan Climent Vidal , Enric Cosme Llópez , Raúl Ruiz Mora

Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…

Logic in Computer Science · Computer Science 2018-05-17 Dan Marsden , Fabrizio Genovese

We introduce the new concept of cartesian module over a pseudofunctor $R$ from a small category to the category of small preadditive categories. Already the case when $R$ is a (strict) functor taking values in the category of commutative…

Rings and Algebras · Mathematics 2015-05-27 Sergio Estrada , Simone Virili

We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…

Category Theory · Mathematics 2014-06-23 Olivia Caramello

Temporal logics stands for a widely adopted family of formalisms for the verification of computational devices, enriching propositional logics by operators predicating on the step-wise behaviour of a system. Its quantified extensions allow…

Logic in Computer Science · Computer Science 2022-01-05 Fabio Gadducci , Davide Trotta

This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…

Logic · Mathematics 2008-01-16 Benno van den Berg , Ieke Moerdijk

From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect…

Logic in Computer Science · Computer Science 2019-01-30 Robert Furber

We generalize the construction of reflection functors from classical representation theory of quivers to arbitrary small categories with freely attached sinks or sources. These reflection morphisms are shown to induce equivalences between…

Algebraic Topology · Mathematics 2017-09-12 Moritz Groth , Jan Stovicek

We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…

Category Theory · Mathematics 2023-02-21 Max S. New , Daniel R. Licata

We introduce a notion of (co)presheaf on a lax double functor $X$, which we generally call an instance. In the terminology of double-categorical logic, a lax double functor valued in sets, possibly preserving finite products, is called a…

Category Theory · Mathematics 2026-05-06 Kevin Carlson , Evan Patterson

We construct reflection functors on categories of modules over deformed wreath products of the preprojective algebra of a quiver. These functors give equivalences of categories associated to generic parameters which are in the same orbit…

Representation Theory · Mathematics 2007-05-23 Wee Liang Gan

Experience shows that the poset of levels (or dimensions) of the topos of presheaves on some elegant Reedy categories may be equipped with a monotone increasing `successor' function which, as the case of simplicial sets shows, is different…

Category Theory · Mathematics 2023-08-10 Matí as Menni

A pretorsion theory for the category of all categories is presented. The associated prekernels and precokernels are calculated for every functor.

Category Theory · Mathematics 2020-12-03 João J. Xarez

Any refinement system (= functor) has a fully faithful representation in the refinement system of presheaves, by interpreting types as relative slice categories, and refinement types as presheaves over those categories. Motivated by an…

Logic in Computer Science · Computer Science 2015-08-04 Paul-André Melliès , Noam Zeilberger

In this paper, we present a unified approach using model category theory and an associative law to compare some classic variants of the geometric realization functor.

Algebraic Topology · Mathematics 2018-04-03 Yi-Sheng Wang

Lax extensions of set functors play a key role in various areas including topology, concurrent systems, and modal logic, while predicate liftings provide a generic semantics of modal operators. We take a fresh look at the connection between…

Category Theory · Mathematics 2023-12-08 Sergey Goncharov , Dirk Hofmann , Pedro Nora , Lutz Schröder , Paul Wild

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

Logic in Computer Science · Computer Science 2019-03-14 Pierre-Louis Curien , Samuel Mimram