A refinement of Stone duality to skew Boolean algebras

We establish two theorems that refine the classical Stone duality between generalized Boolean algebras and locally compact Boolean spaces. In the first theorem, we prove that the category of left-handed skew Boolean algebras whose morphisms are proper skew Boolean algebra homomorphisms is equivalent to the category of étale spaces over locally compact Boolean spaces whose morphisms are étale space cohomomorphisms over continuous proper maps. In the second theorem, we prove that the category of left-handed skew Boolean -algebras whose morphisms are proper skew Boolean -algebra homomorphisms is equivalent to the category of étale spaces with compact clopen equalizers over locally compact Boolean spaces whose morphisms are injective étale space cohomomorphisms over continuous proper maps.     

The Loomis–Sikorski Theorem revisited

We prove, constructively, that the Loomis–Sikorski Theorem for σ-complete Boolean algebras follows from a representation theorem for Archimedean vector lattices and a constructive representation of Boolean algebras as spaces of Carathéodory place functions. We also prove a constructive subdirect product representation theorem for arbitrary partially ordered vector spaces. Received August 10, 2006; accepted in final form May 30, 2007.     

Σ-bounded algebraic systems and universal functions. II

Ershov algebras, Boolean algebras, and abelian p-groups are Σ-bounded systems, and there exist universal Σ-functions in hereditarily finite admissible sets over them.     

Lattice subordinations and Priestley duality

There is a well-known correspondence between Heyting algebras and S4-algebras. Our aim is to extend this correspondence to distributive lattices by defining analogues of S4-algebras for them. For this purpose, we introduce binary relations on Boolean algebras that resemble de Vries proximities. We term such binary relations lattice subordinations. We show that the correspondence between Heyting algebras and S4-algebras extends naturally to distributive lattices and Boolean algebras with a lattice subordination. We also introduce Heyting lattice subordinations and prove that the category of Boolean algebras with a Heyting lattice subordination is isomorphic to the category of S4-algebras, thus obtaining the correspondence between Heyting algebras and S4-algebras as a particular case of our approach. In addition, we provide a uniform approach to dualities for these classes of algebras. Namely, we generalize Priestley spaces to quasi-ordered Priestley spaces and show that lattice subordinations on a Boolean algebra B correspond to Priestley quasiorders on the Stone space of B. This results in a duality between the category of Boolean algebras with a lattice subordination and the category of quasi-ordered Priestley spaces that restricts to Priestley duality for distributive lattices. We also prove that Heyting lattice subordinations on B correspond to Esakia quasi-orders on the Stone space of B. This yields Esakia duality for S4-algebras, which restricts to Esakia duality for Heyting algebras.     

Measures on minimally generated Boolean algebras

We investigate properties of minimally generated Boolean algebras. It is shown that all measures defined on such algebras are separable but not necessarily weakly uniformly regular. On the other hand, there exist Boolean algebras small in terms of measures which are not minimally generated. We prove that under CH a measure on a retractive Boolean algebra can be nonseparable. Some relevant examples are indicated. Also, we give two examples of spaces satisfying some kind of Efimov property.     

Bordism of algebras over Hopf algebras

An algebraic theory of bordism via characteristic numbers, analogous to topological bordism, is given. The Steenrod algebra is replaced by a fairly general graded Hopf algebra A, topological spaces by algebras over A, vector bundles by Thom modules, and closed manifolds by Poincaré algebras over A.     

Component partially ordered sets

Properties of component partially ordered sets (i.e., dense subsets of Boolean algebras) are used to construct mappings of Boolean algebras generalizing the idea of homomorphisms; the properties of a minimal Boolean algebra generated by a given component partially ordered set are investigated.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 275–283, March, 1971.     

The completeness of the isomorphism relation for countable Boolean algebras

We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen's classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an essential way. We also give a stronger form of the Vaught conjecture for Boolean algebras which states that, for any complete first-order theory of Boolean algebras that has more than one countable model up to isomorphism, the class of countable models for the theory is Borel complete. The results are applied to settle many other classification problems related to countable Boolean algebras and separable Boolean spaces. In particular, we will show that the following equivalence relations are Borel complete: the translation equivalence between closed subsets of the Cantor space, the isomorphism relation between ideals of the countable atomless Boolean algebra, the conjugacy equivalence of the autohomeomorphisms of the Cantor space, etc. Another corollary of our results is the Borel completeness of the commutative AF -algebras, which in turn gives rise to similar results for Bratteli diagrams and dimension groups.

     

Endoprimal algebras

An algebra A is endoprimal if, for all the only maps from A ^k to A which preserve the endomorphisms of A are its term functions. One method for finding finite endoprimal algebras is via the theory of natural dualities since an endodualisable algebra is necessarily endoprimal. General results on endoprimality and endodualisability are proved and then applied to the varieties of sets, vector spaces, distributive lattices, Boolean algebras, Stone algebras, Heyting algebras, semilattices and abelian groups. In many classes the finite endoprimal algebras turn out to be endodualisable. We show that this fails in general by proving that , regarded as either a bounded semilattice or upper-bounded semilattice is dualisable, endoprimal but not endodualisable. Received May 16, 1997; accepted in final form November 6, 1997.     

Elementary Equivalence of Linear Groups Over Rings with a Finite Number of Central Idempotents and Over Boolean Rings

In the present paper, we start with a criterion of elementary equivalence of linear groups over rings with just a finite number of central idempotents. Then we study elementary equivalence of linear groups over Boolean algebras. We prove that two linear groups over Boolean algebras are elementarily equivalent if and only if their dimensions coincide and these Boolean algebras are elementarily equivalent.     

A non-commutative Priestley duality

We prove that the category of left-handed strongly distributive skew lattices with zero and proper homomorphisms is dually equivalent to a category of sheaves over local Priestley spaces. Our result thus provides a non-commutative version of classical Priestley duality for distributive lattices and generalizes the recent development of Stone duality for skew Boolean algebras.     

On algebras of holomorphic functions of a given type

We show that several spaces of holomorphic functions on a Riemann domain over a Banach space, including the nuclear and Hilbert–Schmidt bounded type, are locally m-convex Fréchet algebras. We prove that the spectrum of these algebras has a natural analytic structure, which we use to characterize the envelope of holomorphy. We also show a Cartan–Thullen type theorem.     

Varieties whose finitely generated members are free

We prove that a variety of algebras whose finitely generated members are free must be definitionally equivalent to the variety of sets, the variety of pointed sets, a variety of vector spaces over a division ring, or a variety of affine vector spaces over a division ring.     

Computable Homogeneous Boolean Algebras and a Metatheorem

We consider computable homogeneous Boolean algebras. Previously, countable homogeneous Boolean algebras have been described up to isomorphism and a simple criterion has been found for the existence of a strongly constructive (decidable) isomorphic copy for such. We propose a natural criterion for the existence of a constructive (computable) isomorphic copy. For this, a new hierarchy of -computable functions and sets is introduced, which is more delicate than Feiner's. Also, a metatheorem is proved connecting computable Boolean algebras and their hyperarithmetical quotient algebras.     

Join-continuous frames,Priestley's duality and biframes

The primary purpose of this paper is to study join-continuous frames. We present two representation theorems for them: one in terms of -subframes of complete Boolean algebras and the other in terms of certain Priestley spaces. This second representation is used to prove that the topological spaces whose frame of open sets is join-continuous are characterized by a condition which says that certain intersections of open sets are open. Finally, we show that Priestley's duality can be viewed as a partialization of the dual adjunction between the categories of, respectively, bitopological spaces and biframes, stated by B. Banaschewski, G. C. L. Brümmer and K. A. Hardie in [5].This work was partially supported by Centro de Matemáíica da Universidade de Coimbra.     

More constructions for Boolean algebras

 We construct Boolean algebras with prescribed behaviour concerning depth for the free product of two Boolean algebras over a third, in ZFC using pcf; assuming squares we get results on ultraproducts. We also deal with the family of cardinalities and topological density of homomorphic images of Boolean algebras (you can translate it to topology - on the cardinalities of closed subspaces); and lastly we deal with inequalities between cardinal invariants, mainly . Received: 9 September 1998 / Published online: 7 May 2002     

Separability and decidability results for varieties of Jónsson dynamic algebras

Dynamic algebras are algebraic counterparts of dynamic logics: propositional logical systems endowed with a set of modal operators. In [18], B. Jónsson introduced dynamic algebras as Boolean algebras with unary operators, the indices of which range over a given Kleene algebra. On the other hand, V.R. Pratt and D. Kozen proposed a two-sorted approach to dynamic algebras, which was followed in the early papers on the topic, such as Fischer and Ladner [15] and Németi [28]. For a recent overview of the field cf. [4]. In the present paper we investigate connections (as well as diversities) between these two approaches. Our main aim is to transfer (where possible) two-sorted results on separability and decidability to the one-sorted case and to extend them to broad classes of varieties of Jónsson dynamic algebras. In particular, as a consequence of such considerations, we obtain a decidability result on Kleene algebras.     

Abstract ordered compact convex sets and algebras of the (sub)probabilistic powerdomain monad over ordered compact spaces

The majority of categories used in denotational semantics are topological in nature. One of these is the category of stably compact spaces and continuous maps. Previously, Eilenberg–Moore algebras were studied for the extended probabilistic powerdomain monad over the category of ordered compact spaces X and order-preserving continuous maps in the sense of Nachbin. Appropriate algebras were characterized as compact convex subsets of ordered locally convex topological vector spaces. In so doing, functional analytic tools were involved. The main accomplishments of this paper are as follows: the result mentioned is re-proved and is extended to the subprobabilistic case; topological methods are developed which defy an appeal to functional analysis; a more topological approach might be useful for the stably compact case; algebras of the (sub)probabilistic powerdomain monad inherit barycentric operations that satisfy the same equational laws as those in vector spaces. Also, it is shown that it is convenient first to embed these abstract convex sets in abstract cones, which are simpler to work with. Lastly, we state embedding theorems for abstract ordered locally compact cones and compact convex sets in ordered topological vector spaces.