This paper concerns the
algebraic constructions of Boolean powers and bounded Boolean powers of structures
A for an arbitrary first-order language. The notion of B-separating is used to
improve results about the logic of reduced power structures. For A recursive we
construct recursive models of the theory of each reduced power of A. Finally, it is
shown that any complete theory is equivalent to a finitely axiomatizable extension of
its Horn consequences.