Related papers: Closure hyperdoctrines, with paths
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…
By a closure space we will mean a pair $(A,\mathcal{C})$, in which $A$ is a set and $\mathcal{C}$ a set of subsets of $A$ closed under arbitrary intersections. The purpose of this paper is to initiate a development of descent theory of…
We introduce the notion of an orthocomplemented subspace of a Hilbert space H, that is, a pair of orthogonal closed subspaces of H, as a two-dimensional counterpart to the one-dimensional notion of a closed subspace of H. Orthocomplemented…
Concept-based Models are a class of inherently explainable networks that improve upon standard Deep Neural Networks by providing a rationale behind their predictions using human-understandable `concepts'. With these models being highly…
We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms…
Quasi-probabilities appear across diverse areas of physics, but their conceptual foundations remain unclear: they are often treated merely as computational tools, and operations like conditioning and Bayes' theorem become ambiguous. We…
This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…
Our work over the past years shows that not only the collection of (for instance) all topological spaces gives rise to a category, but also each topological space can be seen individually as a category by interpreting the convergence…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.
Polyhedral semantics is a recently introduced branch of spatial modal logic, in which modal formulas are interpreted as piecewise linear subsets of an Euclidean space. Polyhedral semantics for the basic modal language has already been well…
Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have…
This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…
The gravitational path integral suggests a striking result: the Hilbert space of closed universes in each superselection sector, a so-called $\alpha$-sector, is one-dimensional. We develop an abstract formalism encapsulating recent…
There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…
Closure operators are very useful tools in several areas of classical mathematics and in general category theory. In fuzzy set theory, fuzzy closure operators have been studied by G. Gerla (1966). These works generally define a fuzzy subset…
Graph-based frames have been introduced as a logical framework which internalizes an inherent boundary to knowability. They also support the interpretation of lattice-based (modal) logics as hyper-constructive logics of evidential…
This is the author's Ph.D. Thesis. It contains results from four years of research into realizability and categorical logic. The main subjects are the axiomatisation of realizable propositions, and a characterization of realizability…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
We present in this paper a reformulation of the usual set-theoretical semantics of the description logic $\mathcal{ALC}$ with general TBoxes by using categorical language. In this setting, $\mathcal{ALC}$ concepts are represented as…