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 15:07, 19 September 2005 (went for the rewrite). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

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]