Related papers: Domains and Classifying Topoi
Any scheme has its associated little and big Zariski toposes. These toposes support an internal mathematical language which closely resembles the usual formal language of mathematics, but is "local on the base scheme": For example, from the…
What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying…
Synthetic algebraic geometry uses homotopy type theory extended with three axioms to develop algebraic geometry internal to a higher version of the Zariski topos. In this article we make no essential use of the higher structure and use…
We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…
A theory of dg schemes is developed so that it becomes a homotopy site, and the corresponding infinity category of stacks is equivalent to the infinity category of stacks, as constructed by Toen and Vezzosi, on the site of dg algebras whose…
In a Systems Engineering setting, various models are produced using a variety of methods and tools. Focusing on a type of models -- called descriptive models -- which we shall describe, we argue that, while the clarity and precision of…
The language of homotopy type theory has proved to be appropriate as an internal language for various higher toposes, for example with Synthetic Algebraic Geometry for the Zariski topos. In this paper we apply such techniques to the higher…
We present and characterize the classes of Grothendieck toposes having enough supercompact objects or enough compact objects. In the process, we examine the subcategories of supercompact objects and compact objects within such toposes and…
Let $X$ be either a quasi-compact semi-separated scheme, or a Noetherian scheme of finite Krull dimension. We show that the Grothendieck abelian category $X{-}\mathsf{Qcoh}$ of quasi-coherent sheaves on $X$ satisfies the Roos axiom…
The so-called topos approach provides a radical reformulation of quantum theory. Structurally, quantum theory in the topos formulation is very similar to classical physics. There is a state object, analogous to the state space of a…
We construct Grothendieck topologies on the path category of a finite graph, examining both coarse and discrete cases that offer different perspectives on quiver representations. The coarse topology declares each vertex covered by all…
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
In the field of quantum simulation of condensed matter phenomena by artificially engineering the Hamiltonian of an atomic, molecular or optical system, the concept of `synthetic dimensions' has recently emerged as a powerful way to emulate…
In this survey, we provide an overview of category theory-derived machine learning from four mainstream perspectives: gradient-based learning, probability-based learning, invariance and equivalence-based learning, and topos-based learning.…
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…
We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the…
We show that a functor category whose domain is a colored category is a topos.The topos structure enables us to introduce cohomology of colored categories including quasi-schemoids. If the given colored category arises from an association…
We give an adequate denotational semantics for languages with recursive higher-order types, continuous probability distributions, and soft constraints. These are expressive languages for building Bayesian models of the kinds used in…
We propose the design of novel categorical generative AI architectures (GAIAs) using topos theory, a type of category that is ``set-like": a topos has all (co)limits, is Cartesian closed, and has a subobject classifier. Previous theoretical…
We develop a domain-theoretic framework for imprecise probability reasoning and inference on general topological spaces with a countably based continuous lattice of open sets. We address two distinct forms of uncertainty: partial or…