Related papers: An effective version of the Stone duality
This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms…
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…
We introduce a notion of the space of types in positive model theory based on Stone duality for distributive lattices. We show that this space closely mirrors the Stone space of types in the full first-order model theory with negation…
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
A common feature of many duality results is that the involved equivalence functors are liftings of hom-functors into the two-element space resp. lattice. Due to this fact, we can only expect dualities for categories cogenerated by the…
We investigate whether an arbitrary base for a dense-in-itself topological space can be partitioned into two bases. We prove that every base for a T_3 Lindel\"of topology can be partitioned into two bases while there exists a consistent…
Open sets and compact saturated sets enjoy a perfect formal symmetry, at least for classes of spaces such as Stone spaces or spectral spaces. For larger classes of spaces, a perfect symmetry may not be available, although strong signs of it…
We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…
The classical Stone duality associates to each Boolean algebra a topological space consisting of ultrafilters. Lawson's generalisation constructs a dual equivalence of categories of Boolean inverse $\land$-semigroups and Hausdorff ample…
The notions of a {\em 2-precontact space}\/ and a {\em 2-contact space}\/ are introduced. Using them, new representation theorems for precontact and contact algebras are proved. It is shown that there are bijective correspondences between…
We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…
In this paper we continue to study the property of separability of functional space C(X) with the open-point and bi-point-open topologies.
Generalizing Duality Theorem of V. V. Fedorchuk, we prove Stone-type duality theorems for the following four categories: all of them have as objects the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous…
A space is reversible if every continuous bijection of the space onto itself is a homeomorphism. In this paper we study the question of which countable spaces with a unique non-isolated point are reversible. By Stone duality, these spaces…
A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
Here we present an overview of countably-normed spaces. We discuss the main topologies--weak, strong, and inductive--placed on the dual of a countably-normed space and discuss the sigma-fields generated by these topologies. In particular,…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
We extend Priestley Duality to suitable categories of fuzzy topological spaces and ordered algebraic structures that generalize bounded distributive lattices. The duality we prove extends not only classical Priestley Duality between…
The main source of inspiration for the present paper is the work of R. Rosebrugh and R.J. Wood on constructive complete distributive lattices where the authors employ elegantly the concepts of adjunction and module in their study of ordered…