Complete Boolean algebra is an extension of Boolean algebra that includes additional properties to ensure that every subset of its elements has a supremum (least upper bound) and an infimum (greatest lower bound).
Articles by others on the same topic
There are currently no matching articles.