A <r-complete Boolean algebra is a Boolean algebra in which for every sequence of elements a$-, i = l, • • • , there is an element U?an, the countable union of the a», such that aiQU?an for every i, and such that if diQx for every i then U?anQx. The dual operation, countable intersection, can be introduced through complementation, and the distributive law afMJi*'a» = Uf {aC\an) and its dual can...