Related papers: The Grothendieck computability model

For a certain class of abelian categories, we show how to make sense of the "Euler characteristic" of an infinite projective resolution (or, more generally, certain chain complexes that are only bounded above), by passing to a suitable…

We explain how categories, and groupoids, can be seen as models for a Lawvere ${\mathfrak Gr}$-theory, where ${\mathfrak Gr}$ is the category of graphs, and show that for Lawvere ${\mathfrak Gr}$-theories finitely presentable models are…

In this Book we argue that the fruitful interaction of computer vision and belief calculus is capable of stimulating significant advances in both fields. From a methodological point of view, novel theoretical results concerning the…

We introduce a topological variant of the Grothendieck construction which serves to represent every fiber bundle over an Alexandroff space. Using this result we give a classification theorem for fiber bundles over Alexandroff spaces with…

Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…

We define and study notions of comprehension in $(\infty,1)$-category theory. In essence, we do so by implementing B\'{e}nabou's foundations of naive category theory in a univalent meta-theory. In particular, we develop natural…

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…

We define a notion on preadditive categories which plays a role similar to the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define…

We define the Grothendieck group of an $n$-exangulated category. For $n$ odd, we show that this group shares many properties with the Grothendieck group of an exact or a triangulated category. In particular, we classify dense complete…

There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…

We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…

We prove that the category of trees $\Omega$ is a test category in the sense of Grothendieck. This implies that the category of dendroidal sets is endowed with the structure of a model category Quillen-equivalent to spaces. We show that…

The Seifert-van Kampen theorem computes the fundamental group of a space from the fundamental groups of its constituents. We develop a modular SVK framework within the setting of computational paths - an approach to equality where witnesses…

Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…

We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…

Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics. In recent years, more and more expressive notions of operationally-based logical relations have been…

We study the primitive recursive analogue of computable categoricity spectra for various natural classes of structures. We show that these notions coincide for all relatively $\Delta_{2}^{0}$-categorical equivalence structures and linear…

The paper studies the problem of the cofibrant generation of a model category. We prove that, assuming Vop\v{e}nka's principle, every cofibrantly generated model category is Quillen equivalent to a combinatorial model category. We discuss…

We investigate fibrancy conditions in the Thomason model structure on the category of small categories. In particular, we show that the category of weak equivalences of a partial model category is fibrant. Furthermore, we describe…

The Popescu-Gabriel theorem states that each Grothendieck abelian category is a localization of a module category. In this paper, we prove an analogue where Grothendieck abelian categories are replaced by triangulated categories which are…