Related papers: Beth definability and the Stone-Weierstrass Theore…
Stone duality is an indispensable tool for the study of compact, zero-dimensional, Hausdorff spaces. In the case of general compact Hausdorff spaces one can get quite a bit of mileage by considering the `Wallman duality' between compact…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
We prove that every abstract elementary class (a.e.c.) with LST number $\kappa$ and vocabulary $\tau$ of cardinality $\leq \kappa$ can be axiomatized in the logic ${\mathbb L}_{\beth_2(\kappa)^{+++},\kappa^+}(\tau)$. In this logic an a.e.c.…
Stone's representation theorem asserts a duality between Boolean algebras on the one hand and Stone space, which are compact, Hausdorff, and totally disconnected, on the other. This duality implies a natural isomorphism between the…
Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…
Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable…
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…
We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz…
We give an extension of the Fekete's Subadditive Lemma for a set of submultiplicative functionals on countable product of compact spaces. Our method can be considered as an unfolding of the ideas [1]Theorem 3.1 and our main result is an…
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong…
We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…
We consider the explicit fragment of the basic justification stit logic introduced in earlier publications. We define a Hilbert-style axiomatic system for this logic and show that this system is strongly complete relative to the intended…
We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…
We present a collection of results that imply that an endofunctor on a category has a terminal object obtainable as a countable limit of its terminal-coalgebra chain. This holds for finitary endofunctors preserving nonempty binary…
In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…
Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…
In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…
Combining ideas coming from Stone duality and Reynolds parametricity, we formulate in a clean and principled way a notion of profinite lambda-term which, we show, generalizes at every type the traditional notion of profinite word coming…
As has already been pointed out by Birkhoff and von Neumann, quantum logic can be formulated in terms of projective geometry. In three-dimensional Hilbert space, elementary logical propositions are associated with one-dimensional subspaces,…
In this short note we prove a theorem of the Stone-Weierstrass sort for subsets of the cone of non-decreasing continuous functions on compact partially ordered sets.