Pseudo-trees and Boolean algebras

We consider Boolean algebras constructed from pseudo-trees in various ways and make comments about related classes of Boolean algebras.     

Imaginaries in Boolean algebras

Given an infinite Boolean algebra B, we find a natural class of $\varnothing$‐definable equivalence relations $\mathcal {E}_{B}$ such that every imaginary element from B^eq is interdefinable with an element from a sort determined by some equivalence relation from $\mathcal {E}_{B}$. It follows that B together with the family of sorts determined by $\mathcal {E}_{B}$ admits elimination of imaginaries in a suitable multisorted language. The paper generalizes author's earlier results concerning definable equivalence relations and weak elimination of imaginaries for Boolean algebras, obtained in 10 .     

The depth of ultraproducts of Boolean algebras

We show that if μ is a compact cardinal then the depth of ultraproducts of less than μ many Boolean algebras is at most μ plus the ultraproduct of the depths of those Boolean algebras. Received May 18, 2004; accepted in final form December 9, 2004.     

Zero-divisor graphs, von Neumann regular rings, and Boolean algebras

For a commutative ring R with set of zero-divisors Z(R), the zero-divisor graph of R is Γ(R)=Z(R)−{0}, with distinct vertices x and y adjacent if and only if xy=0. In this paper, we show that Γ(T(R)) and Γ(R) are isomorphic as graphs, where T(R) is the total quotient ring of R, and that Γ(R) is uniquely complemented if and only if either T(R) is von Neumann regular or Γ(R) is a star graph. We also investigate which cardinal numbers can arise as orders of equivalence classes (related to annihilator conditions) in a von Neumann regular ring.     

Algebraic lattices and Boolean algebras

In this paper we establish several equivalent conditions for an algebraic lattice to be a finite Boolean algebra. This paper is dedicated to Walter Taylor. Received February 11, 2005; accepted in final form October 9, 2005.     

Minimally generated Boolean algebras

We introduce the class of minimally generated Boolean algebras, i.e. those algebras representable as the union of a continuous well-ordered chain of subalgebras A ₁ where A _i+1 is a minimal extension of A _i. Minimally generated algebras are closely related to interval algebras and superatomic algebras.     

Comparison of Boolean algebras

In this work, some results related to superatomic Boolean interval algebras are presented, and proved in a topological way. Let x be an uncountable cardinal. To each I x, we can associate a superatomic interval Boolean algebra B _I of cardinality x in such a way that the following properties are equivalent: (i) I I x, (ii) B _I is a quotient algebra of B _J, and (iii) there is an homomorphism f from B _J into B _I such that for every atom b of B _I, there is an atom a of B _J satisfying f(a)=b. As a corollary, there are 2 ^x isomorphism types of superatomic interval Boolean algebras of cardinality x. This case is quite different from the countable one.     

Superatomic Boolean algebras constructed from strongly unbounded functions

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ^{++ +} ≤ λ, κ^<κ = κ and 2^κ = κ⁺, and η is an ordinal with κ⁺ ≤ η < κ⁺⁺ and cf(η) = κ⁺. Then, in some cardinal‐preserving generic extension there is a superatomic Boolean algebra $\mathcal BUsing Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ^{++ +} ≤ λ, κ^<κ = κ and 2^κ = κ⁺, and η is an ordinal with κ⁺ ≤ η < κ⁺⁺ and cf(η) = κ⁺. Then, in some cardinal‐preserving generic extension there is a superatomic Boolean algebra $\mathcal B$ such that $\mathrm{ht}(\mathcal B) = \eta + 1$, $\mathrm{wd}_{\alpha }(\mathcal B) = \kappa$ for every α < η and $\mathrm{wd}_{\eta }(\mathcal B) = \lambda$(i.e., there is a locally compact scattered space with cardinal sequence 〈κ〉_η^??〈λ〉). Especially, $\langle {\omega }\rangle _{{\omega }_1}{}^{\smallfrown } \langle {\omega }_3\rangle$ and $\langle {\omega }_1\rangle _{{\omega }_2}{}^{\smallfrown } \langle {\omega }_4\rangle$ can be cardinal sequences of superatomic Boolean algebras.     

Endomorphisms of monadic Boolean algebras

A classical result about Boolean algebras independently proved by Magill [10], Maxson [11], and Schein [17] says that non-trivial Boolean algebras are isomorphic whenever their endomorphism monoids are isomorphic. The main point of this note is to show that the finite part of this classical result is true within monadic Boolean algebras. By contrast, there exists a proper class of non-isomorphic (necessarily) infinite monadic Boolean algebras the endomorphism monoid of each of which has only one element (namely, the identity), this being the first known example of a variety that is not universal (in the sense of Hedrlín and Pultr), but contains a proper class of non-isomorphic rigid algebras (that is, the identity is the only endomorphism). Received February 3, 2006; accepted in final form September 5, 2006.     

Chain homogeneous Souslin algebras

Assuming Jensen's principle ?⁺ we construct Souslin algebras all of whose maximal chains are pairwise isomorphic as total orders, thereby answering questions of Koppelberg and Todor?evi?.     

Free Boolean algebras over unions of two well orderings

Given a partially ordered set P there exists the most general Boolean algebra which contains P as a generating set, called the free Boolean algebra over P. We study free Boolean algebras over posets of the form P=P₀∪P₁, where P₀, P₁ are well orderings. We call them nearly ordinal algebras.Answering a question of Maurice Pouzet, we show that for every uncountable cardinal κ there are κ² pairwise non-isomorphic nearly ordinal algebras of cardinality κ.Topologically, free Boolean algebras over posets correspond to compact 0-dimensional distributive lattices. In this context, we classify all closed sublattices of the product (ω₁+1)×(ω₁+1), showing that there are only ℵ₁ many types. In contrast with the last result, we show that there are ℵ₁² topological types of closed subsets of the Tikhonov plank (ω₁+1)×(ω+1).     

Computably categorical Boolean algebras enriched by ideals and atoms

We describe computably categorical Boolean algebras whose language is enriched by one-place predicates that distinguish a finite set of ideals and atoms with respect to some ideals in this set.     

A superatomic Boolean algebra with few automorphisms

Assuming GCH, we prove that for every successor cardinal μ > ω₁, there is a superatomic Boolean algebra B such that |B| = 2^μ and |Aut B| = μ. Under ◊_ω1, the same holds for μ = ω₁. This answers Monk's Question 80 in [Mo]. Received: 1 January 1998 / Revised version: 18 May 1999 / Published online: 21 December 2000     

A combinatorial characterization of normalizations of Boolean algebras

In this paper we prove that if a groupoid has exactly distinct n-ary term operations for n=1, 2, 3 and the same number of constant unary term operations for n=0, then it is a normalization of a nontrivial Boolean algebra. This, together with some general facts concerning normalizations of algebras, which we recall, yields a clone characterization of normalizations of nontrivial Boolean algebras: A groupoid (G;·) is clone equivalent to a normalization of a nontrivial Boolean algebra if and only if the value of the free spectrum for (G;·) is for n = 0, 1, 2, 3. In the last section the Minimal Extension Property for the sequence (2, 3) in the class of all groupoids is derived. Received September 15, 2004; accepted in final form October 4, 2005.     

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.     

Congruences and ideals on Boolean modules: a heterogeneous point of view

Definitions for heterogeneous congruences and heterogeneous ideals on a Boolean module $\mathcal {M}$ are given and the respective lattices $\mathrm{Cong}\mathcal {M}$ and $\mathrm{Ide}\mathcal {M}$ are presented. A characterization of the simple bijective Boolean modules is achieved differing from that given by Brink in a homogeneous approach. We construct the smallest and the greatest modular congruence having the same Boolean part. The same is established for modular ideals. The notions of kernel of a modular congruence and the congruence induced by a modular ideal are introduced to describe an isomorphism between $\mathrm{Cong}\mathcal {M}$ and $\mathrm{Ide}\mathcal {M}$. This isomorphism leads us to conclude that the class of the Boolean module is ideal determined.     

Weakly measurable cardinals

In this article, we introduce the notion of weakly measurable cardinal, a new large cardinal concept obtained by weakening the familiar concept of a measurable cardinal. Specifically, a cardinal κ is weakly measurable if for any collection $\mathcal {A}$ containing at most κ⁺ many subsets of κ, there exists a nonprincipal κ‐complete filter on κ measuring all sets in $\mathcal {A}$. Every measurable cardinal is weakly measurable, but a weakly measurable cardinal need not be measurable. Moreover, while the GCH cannot fail first at a measurable cardinal, I will show that it can fail first at a weakly measurable cardinal. More generally, if κ is measurable, then we can make its weak measurability indestructible by the forcing Add(κ, η) for any η while forcing the GCH to hold below κ. Nevertheless, I shall prove that weakly measurable cardinals and measurable cardinals are equiconsistent. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Some results on abstract commutative ideal theory

Conditions are given for a multiplicative lattice to be a finite Boolean algebra. Multiplicative lattices in which semiprimary elements are primary or in which prime elements are weak meet principal are studied. The lattice of filters of a bounded commutative semilattice are investigated. Finally, we study compactly packed lattices.     

Free‐decomposability in varieties of semi‐Heyting algebras

In this paper we prove that the free algebras in a subvariety $\mathcal V$ of the variety $\mathcal {SH}$ of semi‐Heyting algebras are directly decomposable if and only if $\mathcal V$ satisfies the Stone identity.