Related papers: More on Geometric Morphisms between Realizability …
In this paper we further the study of arrow algebras, simple algebraic structures inducing toposes through the tripos-to-topos construction, by defining appropriate notions of morphisms between them which correspond to morphisms of the…
We give simple characterizations of the category PAsm(A) of partitioned assemblies, and of the realizability topos RT(A) over a partial combinatory algebra A. This answers the question for an 'extensional characterization' of realizability…
It it shown that geometric morphisms between elementary toposes can be represented as adjunctions between the corresponding categories of locales. These adjunctions are characterised as those that preserve the order enrichment, commute with…
We study several sufficient conditions for the molecularity/local-connectedness of geometric morphisms. In particuar, we show that if $\mathcal{S}$ is a Boolean topos then, for every hyperconnected essential geometric morphism ${p :…
Let M, N be monoids, and PSh(M), PSh(N) their respective categories of right actions on sets. In this paper, we systematically investigate correspondences between properties of geometric morphisms PSh(M) $\rightarrow$ PSh(N) and properties…
Partial Combinatory Algebras (PCAs) provide a foundational model of the untyped $\lambda$-calculus and serve as the basis for many notions of computability, such as realizability theory. However, PCAs support a very limited notion of…
In this paper we introduce arrow algebras, simple algebraic structures which induce elementary toposes through the tripos-to-topos construction. This includes localic toposes as well as various realizability toposes, in particular, those…
In this article we provide a simple combinatorial description of morphisms between indecomposable complexes in the bounded derived category of a gentle algebra.
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
The notion of an existentially closed model is generalised to a property of geometric morphisms between toposes. We show that important properties of existentially closed models extend to existentially closed geometric morphisms, such as…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra expands this…
We discuss how triposes may be understood as generalizations of localic geometric morphisms.
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
We study morphisms of internal locales of Grothendieck toposes externally: treating internal locales and their morphisms as sheaves and natural transformations. We characterise those morphisms of internal locales that induce surjective…