Talk:Complete Boolean algebra

This page was completely wrong

A complete Boolean algebra is a Boolean algebra in which every subset has a supremum. Not sure which is best--complete rewrite, or redirect to Boolean algebra, where completeness ought to be treated (but isn't yet). --Trovatore 14:56, 19 September 2005 (UTC)[reply]

Went for the rewrite. Hardly more than a dicdef--at some point should either be expanded or changed to a redirect. --Trovatore 15:07, 19 September 2005 (UTC)[reply]

To be honest, I prefer the rewrite. A short article is better than none at all, and I will try to come up with something abou this. Based on the way you talk about it, you seem to know a lot about this. By the way, when you say "subset", you should specify what it is a subset of. Scythe33 23:58, 19 September 2005 (UTC)[reply]

I think that what we have here is a classic case of the same phrase meaning different things to different people. The original page referred to a complete boolean algebra as seen by computer scientists (see http://users.senet.com.au/~dwsmith/concept1.htm for an example - not a very good one perhaps - but the quote from that page "The canonical expansions imply that any Boolean function can be expressed in terms of the AND and ExOR operators. ExOR algebra is therefore a complete Boolean algebra." supports my point). Unfortunately, it seems that the same term means something quite different in a purely mathematical sense. I have no idea how to resolve this ambiguity, so I am merely highlighting its existance in the hope that someone can find a way to fix it. 196.36.80.163 06:56, 7 October 2005 (UTC)[reply]