Jump to content

Talk:Complete set of Boolean operators

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ruud Koot (talk | contribs) at 16:10, 11 October 2005 (Talk:Complete Boolean algebra (computer science) moved to Talk:Completeness (Boolean algebra)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Still some doubts

Can someone here tell me whether the term "complete Boolean algebra" is in fact used for the concept defined in this article? In Googling the only references I can find to it seem likely to have derived either from an old article at Complete Boolean algebra (before I changed that article to the mathematical notion), or from the following site, http://users.senet.com.au/~dwsmith/concept1.htm , which frankly does not inspire confidence. If the dwsmith article simply made up the term, we should probably remove Complete Boolean algebra (computer science), though the content might be recreated under a different name. --Trovatore 17:26, 10 October 2005 (UTC)[reply]


You know, having done a bit of googling myself, I can quite see your point. Especially since all I have to back it up with is memories of a university lecturer who certainly used that term... but some rather intense googling has turned up http://www.southwestern.edu/~shelton/REU02/Presentations/Miller.ppt (do you know how little effect and, or and not have on a google search? Too little...) I don't expect that to help much either, but I'll go home, find my old textbook, check on its definition of the term, and come back here tomorrow with a quote and the name, author and ISBN of the textbook. 196.36.80.163 06:33, 11 October 2005 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Complete_set_of_Boolean_operators&oldid=25284719"