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 Trovatore (talk | contribs) at 14:56, 19 September 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This page is 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]