Let $\mathfrak{B}=(B,\bot,\top,\lnot,\wedge,\vee)$ be a boolean algebra. $B_F$ be the set of all filters on $\mathfrak B$. And for all filter $F$, $G$, $F \wedge_{B_F} G \colon= \mathbf C(F \cup G)$ in which $\mathbf C$ denotes the filter closure operator; $F \vee_{B_F} G \colon= F \cap G$; $0 \colon= B$, $1 \colon= \{\top\}$. Then $(B_F,0,1,\wedge_{B_F},\vee_{B_F})$ makes a complete lattice.
My question is can we add a negation in order to make it be a Boolean algebra?
It is relatively easy to see that it does not matter whether we work with filters or with ideals.
The following is taken verbatim from Steven R. Givant,Paul Richard Halmos: Introduction to Boolean Algebras p.167:
The existence of maximal ideals, which was used in the above excerpt, is guaranteed by Boolean prime ideal theorem.