Union-closed sets and Horn Boolean functions

A family $F$ of sets is union-closed if the union of any two sets from $F$ belongs to $F$. The union-closed sets conjecture states that if $F$ is a finite union-closed family of finite sets, then there is an element that belongs to at least half of the sets in $F$. The conjecture has several equivalent formulations in terms of other combinatorial structures such as lattices and graphs. In its whole generality the conjecture remains wide open, but it was verified for various important classes of lattices, such as lower semimodular lattices, and graphs, such as chordal bipartite graphs. In the present paper we develop a Boolean approach to the conjecture and verify it for several classes of Boolean functions, such as submodular functions and double Horn functions.