Related papers: Beth definability and the Stone-Weierstrass Theore…
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…
Stone duality establishes a contravariant equivalence between the category of Boolean algebras and the category of compact, Hausdorff, totally disconnected topological spaces (Stone spaces). These spaces are precisely the profinite spaces…
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some…
We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…
Distances between sets arise naturally when modeling stochastic dependence on collections of spatial supports, including settings with point-referenced and areal observations. However, commonly used constructions of distances on sets,…
We investigate the failure of the Stone-Weierstrass theorem focusing on the existence of large dimensional vector spaces within the set $\mathcal{C}(L, \mathbb{K}) \setminus \overline{\mathcal{A}}$, where $L$ is a compact Hausdorff space…
We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman's neat…
In this paper, we discuss some questions about compactness in MV-topological spaces. More precisely, we first present a Tychonoff theorem for such a class of fuzzy topological spaces and some consequence of this result, among which, for…
For a compact Hausdorff space $K$, we give descriptions of the dual of $C(K)^\delta$, the Dedekind completion of the Banach lattice $C(K)$ of continuous, real-valued functions on $K$. We characterize those functionals which are…
Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…
Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone…
We extend \L ukasiewicz logic obtaining the infinitary logic $\mathcal{IR}\L$ whose models are algebras $C(X,[0,1])$, where $X$ is a basically disconnected compact Hausdorff space. Equivalently, our models are unit intervals in…
We design hypersequent calculus proof systems for the theories of Riesz spaces and modal Riesz spaces and prove the key theorems: soundness, completeness and cut elimination. These are then used to obtain completely syntactic proofs of some…
The Stone-von Neumann Theorem is a fundamental result which unified the competing quantum mechanical models of matrix mechanics and wave mechanics. It's mechanism of proof ultimately involved the study of unitary group representations on a…
Under Gromov--Hausdorff convergence, and equivariant Gromov--Hausdorff convergence, we prove stability results of Wasserstein spaces over certain classes of singular and non-singular spaces. For example, we obtain an analogue of Perelman's…
Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" (of a particular sort…
Weihrauch reducibility is a notion of reducibility between computational problems that is useful to calibrate the uniform computational strength of a multivalued function. It complements the analysis of mathematical theorems done in reverse…
We prove that any correspondence (multi-function) mapping a metric space into a Banach space that satisfies a certain pointwise Lipschitz condition, always has a continuous selection that is pointwise Lipschitz on a dense set of its domain.…
We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.