Every skew Boolean algebra S has a maximal generalized Boolean algebra image given by S/D where D is the Green's relation defined initially on semigroups. In this paper we study skew Boolean algebras ω(B) constructed from generalized Boolean algebras B by a twisted product construction for which ω(B)/D ∼ = B. In particular we study the congruence lattice of ω(B) with an eye to viewing ω(B) as a minimal skew Boolean cover of B. This construction is the object part of a functor ω : GB → LSB from the category GB of generalized Boolean algebras to the category LSB of left-handed skew Boolean algebras. Thus we also look at its left adjoint functor Ω : LSB → GB.
BackgroundRecall first that a skew lattice is an algebra S = S; ∨, ∧ with associative, idempotent binary operations ∨ and ∧ that satisfy the absorption identities:Equivalently, ∨ and ∧ jointly satisfy the dualities a ∨ b = a iff a ∧ b = b and a ∨ b = b iff a ∧ b = a. Every skew lattice has a natural partial order given by aThe relation ≥ is a special case of commutativity. A skew lattice can have many instances of commutativity. In general these instances can be ambiguous in that only one of say a ∧ b = b ∧ a or a∨b = b∨a need hold. A skew lattice S is symmetric if a∧b = b∧a iff a∨b = b∨a for all a, b ∈ S, thus making commutativity unambiguous. A distinguished element 0 in a skew lattice S is a zero if 0 ∧ a = 0 = a ∧ 0, and thus 0 ∨ a = a = a ∨ 0, for all a ∈ S.A Boolean skew lattice is any symmetric skew lattice with a zero S; ∨, ∧, 0 such that for all a ∈ S, the principal poset ideal ⌈a⌉ = {b ∈ S | a ≥ b} is a Boolean sublattice of S. In this case, the relative complements \ on all these poset ideals