If $U$ is infinite, show that the Boolean algebra of subsets of $U$ that are finite or cofinite (i.e. their complement is finite) is not complete. A Boolean algebra $\mathcal{B}:=(B,\leq,\lor,\land,^c,0,1)$ is said to be complete if every non-empty subset of $B$ has a greatest lower bound (g.l.b).
Let $U'=\{X\subseteq U: X\text{ is finite, or}X^c=U\backslash X\text{ is finite}\}$. I think the Boolean algebra of concern here is $\mathcal{B}:= (U',\subseteq, \cup,\cap,^c,\phi, U)$, right?
From what I understand, the g.l.b operation here is just $\bigcap$, i.e. if $\phi\neq U''\subseteq U'$, then g.l.b($U''$) = $\bigcap_{z\in U''}z$, is that correct?
If that is the case, then the Boolean algebra looks complete* to me - which is contrary to what is required to be proved. Where am I going wrong?
*Looks complete because two sets will always have some intersection, empty or not!