Complete Boolean algebra (source code)

= Complete Boolean algebra
{wiki}

A Boolean algebra in which every set-indexed family has a join and a meet. <Double-negation Boolean algebra> is an intuitionistic example, with joins formed by regularizing unions. Completeness makes truth values for quantifiers possible in a <Boolean-valued inner universe over intuitionistic set theory>.