Related papers: Domain Theory in Constructive and Predicative Univ…
Let f be a function meromorphic in a neighborhood of infinity. The central problem in the present investigation is to find the largest domain D \subset C to which the function f can be extended in a meromorphic and singlevalued manner.…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
Let $T$ be a theory with a definable topology. $T$ is t-minimal in the sense of Mathews if every definable set in one variable has finite boundary. If $T$ is t-minimal, we show that there is a good dimension theory for definable sets,…
The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…
Standard approaches to domain decomposition methods (DDM) are uncapable of producing block-diagonal system matrices. The derived-vector-space (DVS), approach to DDM, introduced in 2013, overcomes this limitation. However, the DVS approach…
Many introductions to homotopy type theory and the univalence axiom gloss over the semantics of this new formal system in traditional set-based foundations. This expository article, written as lecture notes to accompany a 3-part mini course…
Given a $C^{0}$-deformation of domains $D(t)$ on a manifold $M^{n}$, which allows the topological types of the domains $D(t)$ to change with $t$, in what cases are the entities in analysis continuous in $t$, so that analysis techniques…
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
We investigate multi-field multicritical scalar theories using CFT constraints on two- and three-point functions combined with the Schwinger-Dyson equation. This is done in general and without assuming any symmetry for the models, which we…
A Condorcet domain (CD) is a collection of linear orders on a set of candidates satisfying the following property: for any choice of preferences of voters from this collection, a simple majority rule does not yield cycles. We propose a…
The Dependent Object Types (DOT) calculus incorporates concepts from functional languages (e.g. modules) with traditional object-oriented features (e.g. objects, subtyping) to achieve greater expressivity (e.g. F-bounded polymorphism).…
This paper gives a classification of classes of discrete dynamical systems (a set equipped with an endofunction) closed under finite limits and small colimits. The conclusion is simple: they bijectively correspond to the ideals of the…
An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…
We introduce a pro-\'etale geometric object $D_\infty$ arising naturally from the tower of Artin-Schreier extensions in characteristic 2, equipped with a canonical endofunctor $O$ whose fixed points correspond to automorphic representations…
Classical density functional theory for finite temperatures is usually formulated in the grand-canonical ensemble where arbitrary variations of the local density are possible. However, in many cases the systems of interest are closed with…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
In this note we show how one can use recently gained insights from the study of singular SPDEs, more particularly the study of singular operators via the theory of Paracontrolled Distributions, to construct domains for (singular) elliptic…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for…