This MO thread has several examples of complete Boolean algebras that are not isomorphic to $\sigma$-algebra of sets. But what is a non-trivial example of a complete Boolean algebra that is isomorphic to a $\sigma$-algebra of set as Boolean algebras? Equivalently, is there a $\sigma$-algebra of set that is complete as a Boolean algebra?
A trivial example is the power set algebra $\mathcal{P}(X)$, or any algebra of set that is atomic and complete as Boolean algebra. Also, from the above post it seems a non-trivial example is probably not ccc. I am wondering if the tree algebra on some tree such as $2^{<\aleph_1}$ can help, but the tree algebra itself doesn't seem complete, or even $\sigma$. Maybe we can consider its completion?
Clarification: By a complete Boolean algebra I mean a Boolean algebra whose any subset has supremum. An algebra of set (on $X$) is a nonempty subset of $\mathcal{P}(X)$ closed under union and complementation. An algebra of set can be viewed as a Boolean algebra in an obvious way.
Edit: Now I have the feeling that the Boolean completion of the poset $(2^{<\aleph_1},\supseteq)$ should does it. This is the poset of partial map from $\aleph_1$ to $\{0,1\}$ with countable domain, under inverse inclusion (the largest element being the empty map). Every branch in $2^{<\aleph_1}$, equivalently every element in $2^{\aleph_1}$, determines an $\sigma$-complete ultrafilter in the Boolean completion because the branch has uncountable cofinality. The Boolean completion seems to be the regular-open algebra on $2^{\aleph_1}$ with countable support product topology. I'm not sure if it is extremally disconnected; probably not.
There are no non-trivial examples. An algebra of sets is a complete boolean algebra (cBa) iff it is isomorphic to a power set algebra.
For the interesting direction, fix an algebra $\mathcal{A}$ on a set $X$ such that $\mathcal{A}$ is a cBa. Define an equivalence relation $E$ on $X$ by $a E b$ iff $(\forall A \in \mathcal{A})(a \in A \iff b \in A)$. Let $\mathcal{E}$ be the set of $E$-equivalence classes. Now use the fact that $\mathcal{A}$ is a cBa to show that $\mathcal{A} = \{\bigcup \mathcal{W}: \mathcal{W} \subseteq \mathcal{E}\}$. To show this, first check that if $T \in \mathcal{E}$ and $a \in T$, then the $\subseteq$-infimum of the set of those members of $\mathcal{A}$ that contain $a$ is $T$. So $\mathcal{E} \subseteq \mathcal{A}$. Next show that if $\mathcal{W} \subseteq \mathcal{E}$, then $\bigcup \mathcal{W}$ is the $\subseteq$-supremum of $\mathcal{W}$. It follows that $(\mathcal{A}, \subseteq)$ is isomorphic to $(\mathcal{P}(\mathcal{E}), \subseteq)$.