Related papers: The Grothendieck computability model
We introduce fibred type-theoretic fibration categories which are fibred categories between categorical models of Martin-L\"{o}f type theory. Fibred type-theoretic fibration categories give a categorical description of logical predicates…
We produce an indexed version of the Grothendieck construction. This gives an equivalence of categories between opfibrations over a fixed base in the 2-category of 2-copresheaves and 2-copresheaves on the Grothendieck construction of the…
The general theory of Grothendieck categories is presented. We systemize the principle methods and results of the theory, showing how these results can be used for studying rings and modules.
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
In this article, we develop a notion of Quillen bifibration which combines the two notions of Grothendieck bifibration and of Quillen model structure. In particular, given a bifibration $p:\mathcal E\to\mathcal B$, we describe when a family…
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every…
Definability is a key notion in the theory of Grothendieck fibrations that characterises when an external property of objects can be accessed from within the internal logic of the base of a fibration. In this paper we consider a…
Latent fibrations are an adaptation, appropriate for categories of partial maps (as presented by restriction categories), of the usual notion of fibration. The paper initiates the development of the basic theory of latent fibrations and…
Grothendieck fibrations provide a unifying algebraic framework that underlies the treatment of various form of logics, such as first order logic, higher order logics and dependent type theories. In the categorical approach to logic proposed…
This thesis presents a series of theoretical results and practical realisations about the theory of computation in distributive categories. Distributive categories have been proposed as a foundational tool for Computer Science in the last…
We introduce the category of structures and interpretations which allows us to discuss some issues of Grothendieck's anabelian geometry in model-theory terms. Our main result is a formulation in terms of pure stability theory of a problem…
Layered monoidal theories provide a categorical framework for studying scientific theories at different levels of abstraction, via string diagrammatic algebra. We introduce models for three closely related classes of layered monoidal…
We construct two model structures, whose fibrant objects capture the notions of discrete fibrations and of Grothendieck fibrations over a category $\mathcal{C}$. For the discrete case, we build a model structure on the slice…
The aim of this note is to take benefit of the foam nature of the Khovanov-Kuperberg algebras to compute the Grothendieck groups of their categories of finitely generated projective modules. The computation relies on the Hattori-Stallings…
We consider the abelian group $PT$ generated by quasi-equivalence classes of pretriangulated DG categories with relations coming from semi-orthogonal decompositions of corresponding triangulated categories. We introduce an operation of…
We study finiteness conditions in Grothendieck categories by introducing the concepts of objects of type $\text{FP}_n$ and studying their closure properties with respect to short exact sequences. This allows us to propose a notion of…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
Jacobs has proposed definitions for (weak, strong, split) generic objects for a fibered category; building on his definition of (split) generic objects, Jacobs develops a menagerie of important fibrational structures with applications to…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…