Given an infinite Boolean algebra B, we find a natural class of equation image-definable equivalence relations equation image such that every imaginary element from Beq is interdefinable with an element from a sort determined by some equivalence relation from equation image. It follows that B together with the family of sorts determined by equation image 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. (shrink)

We investigate the definable subsets of Stone algebras, introduce the notion of pseudo o-minimality of partially ordered structures, and prove that the completion of the theory of Stone algebras is pseudo o-minimal. We also give the decomposition theorem of Stone algebras.