Related papers: An effective version of the Stone duality
The aim of the present paper is to extend the dualizing object approach to Stone duality to the non-commutative setting of skew Boolean algebras. This continues the study of non-commutative generalizations of different forms of Stone…
We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…
Distributive Stonean residuated lattices are closely related to Stone algebras since their bounded lattice reduct is a Stone algebra. In the present work we follow the ideas presented by Chen and Gr\"{a}tzer and try to apply them for the…
We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…
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 prove versions of the spectral adjunction, a Stone-type duality and Hofmann-Lawson duality for locally small spaces with bounded continuous mappings.
Compact metric spaces form an important class of metric spaces, but the category that they define lacks many important properties such as completeness and cocompleteness. In recent studies of "metric domain theory" and Stone-type dualities,…
As a topological generalization of the notion of a multiset, a boolean multispace is a boolean space $X$ with a continuous function $u\colon X\to \mathbb Z_{>0}$, where $\mathbb Z_{>0}=\{1,2,\dots\}$ has the discrete topology. In this paper…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
We study the properties of topological spaces $(X,\tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ on $X$ has a basis that is (uniformly) definable. Examples of such spaces include the canonical…
We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…
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…
This book is a course in Stone-Priestley duality theory, with applications to logic and theoretical computer science. Our target audience are graduate students and researchers in mathematics and computer science. Our aim is to get in a…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…
De Vries Duality generalizes Stone duality between Boolean algebras and Stone spaces to a duality between de Vries algebras (complete Boolean algebras equipped with a subordination relation satisfying some axioms) and compact Hausdorff…
We extend Yosida's 1941 version of Stone-Gelfand duality to metrically complete unital lattice-ordered groups that are no longer required to be real vector spaces. This calls for a generalised notion of compact Hausdorff space whose points…
We study two classes of spaces whose points are filters on partially ordered sets. Points in MF spaces are maximal filters, while points in UF spaces are unbounded filters. We give a thorough account of the topological properties of these…
We examine several classical concepts from topology and functional analysis, using methods of commutative algebra. We show that these various concepts are all controlled by BC R-rings and their maximal spectra. A BC R-ring is a ring A that…
Attributed graphs model real networks by enriching their nodes with attributes accounting for properties. Several techniques have been proposed for partitioning these graphs into clusters that are homogeneous with respect to both semantic…