Related papers: Self-similarity in the Foundations
We define a unified categorical framework for studying six subproblems arising from the classical Four Subspace Problem. For each subproblem, we construct a functor from its associated category to the category of representations of the…
We prove a result of equivalence invariance of formal category theory for statements that can be expressed within an equipment. To do this, we exploit Henry and Bardomiano Mart\'inez's link between Makkai's FOLDS (first order logic with…
Sentence encoders play a pivotal role in various NLP tasks; hence, an accurate evaluation of their compositional properties is paramount. However, existing evaluation methods predominantly focus on goal task-specific performance. This…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
Density matrix embedding theory (DMET) describes finite fragments in the presence of a surrounding environment. In contrast to most embedding methods, DMET explicitly allows for quantum entanglement between both. In this chapter, we discuss…
The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
The construction of first-order logic and set theory gives rise to apparent circularities of mutual dependence, making it unclear which can act as a self-contained starting point in the foundation of mathematics. In this paper, we carry out…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…
\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…
Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…
In this note we study several topics related to the schema of local reflection $\mathsf{Rfn}(T)$ and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with $\Sigma_n$-definable parameters,…
We give a general criterion for conformal embeddings of vertex operator algebras associated to affine Lie algebras at arbitrary levels. Using that criterion, we construct new conformal embeddings at admissible rational and negative integer…
We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf(Set)-enriched category theory, where Endf(Set) is the category of finitary endofunctors of Set. We identify finitary monads with…
We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…
We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…