Content deleted Content added
| (11 intermediate revisions by 9 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=Start|
{{WikiProject Mathematics|importance=mid}}
}}
==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). --[[User:Trovatore|Trovatore]] 14:56, 19 September 2005 (UTC)
Line 12 ⟶ 15:
Right, done.
:OK, I've put the disambig notice at the top of this article. You may wish to comment at [[Wikipedia talk:WikiProject Computing]] and [[Talk:Complete Boolean algebra (computer science)]], especially if you have knowledge of this term actively being used by workers in computer science other than the author of that webpage (dwsmith). --[[User:Trovatore|Trovatore]] 19:13, 10 October 2005 (UTC)
== I'm working on updating this page ==
I will share my progress so people can give me feedback (if anyone is here to feed me back). Currently I found the source for the "Properties of Complete Boolean Algebras" section, and am about to do a rewrite of a bit of the page to include complete atomic Boolean Algebras, as they are very frequently discussed together in the literature. [[User:Helpsilon delta|Helpsilon delta]] ([[User talk:Helpsilon delta|talk]]) 06:50, 25 August 2025 (UTC)
| |||