Jump to content

Talk:Complete Boolean algebra

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Scythe33 (talk | contribs) at 23:59, 19 September 2005 (→This page was completely wrong). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Complete_Boolean_algebra&oldid=23558924"