Related papers: Syntactic presentations for glued toposes and for …
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
The Galois lattice is a graphic method of representing knowledge structures. The first basic purpose in this paper is to introduce a new class of Galois lattices, called graded Galois lattices. As a direct result, one can obtain the notion…
Categories of models of algebraic theories have good categorical properties except for gluing. Building upon insights and examples from Synthetic Differential Geometry, we introduce a generalisation of models of algebraic theories to…
We develop the theory of topoi internal to an arbitrary $\infty$-topos $\mathcal B$. We provide several characterisations of these, including an internal analogue of Lurie's characterisation of $\infty$-topoi, but also a description in…
We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…
We initiate the study of sheaves on Cech closure spaces, providing a new, unified approach to sheaf theory on many of the major classes of spaces of interest to applications: topological spaces, finite simplicial complexes (seen as $T_0$…
Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…
We show that there is a bijection between the subtoposes of the classifying topos of a geometric theory T over a signature L and the closed geometric theories over L which are `quotients' of the theory T; next, we analyze how classical…
In this article, we introduce the idempotentization process, which bears some philosophical and mathematical similarities with modern analytification and tropicalization. Idempotentization associates to any affine scheme an idempotent…
Formalized $1$-category theory forms a core component of various libraries of mathematical proofs. However, more sophisticated results in fields from algebraic topology to theoretical physics, where objects have "higher structure," rely on…
The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…
Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of representing higher-order entities and relations. This is…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
Assembly Theory, as developed by Cronin and co-workers, assigns to an object an assembly index: the minimal number of binary join operations required to build at least one copy of the object from a specified set of basic building blocks,…
Discovering new drug molecules is a pivotal yet challenging process due to the near-infinitely large chemical space and notorious demands on time and resources. Numerous generative models have recently been introduced to accelerate the drug…
Category theory provides a compact method of encoding mathematical structures in a uniform way, thereby enabling the use of general theorems on, for example, equivalence and universal constructions. In this article we develop the method of…
In [TV], Bertrand To\"en and Michel Vaqui\'e define a scheme theory for a closed monoidal category $(\mathcal{C},\otimes,1)$. One of the key ingredients of this theory is the definition of a Zariski topology on the category of commutative…
Herein we develop category-theoretic tools for understanding network-style diagrammatic languages. The archetypal network-style diagrammatic language is that of electric circuits; other examples include signal flow graphs, Markov processes,…
We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set…