Wikipedia:WikiProject Logic/Boolean algebra task force
From Wikipedia, the free encyclopedia
This page is intended to coordinate efforts of a task force to organize the Wikipedia articles on subjects relating to Boolean algebra, propositional logic, logical connectives, and their applications. The initial goal is to propose a way to organize these articles and announce the proposal to the appropriate wikiprojects.
Contents |
[edit] Current structure
Please feel free to expand or correct this section.
[edit] Articles
Sorted roughly by focus area; many would fit into more than one area.
[edit] Introductions
- Boolean logic, an introductory article with general applications such as computer science
- Boolean algebra (introduction), a short overview of the subject targeted to a general audience
- List of Boolean algebra topics, overview of topics with hardly any explanation
[edit] Algebra
- Algebraic normal form, synonym for Zhegalkin polynomial
- Algebra of sets
- Boolean algebra (structure), the lattice theory definition
- Boolean algebras canonically defined gives an alternative perspective on the structure
- Boolean ring, an algebraic structure equivalent to a Boolean algebra, see also Zhegalkin polynomial
- Complete Boolean algebra
- Field of sets, otherwise known as a Boolean algebra
- Free Boolean algebra
- Relation algebra
- Residuated Boolean algebra
- Stone duality, an equivalence between Boolean algebras and totally disconnected Hausdorff spaces
- Stone's representation theorem for Boolean algebras
- Topological Boolean algebra
- Two-element Boolean algebra
- Zhegalkin polynomial, the Boolean ring basis as alternative to the standard Boolean lattice basis
[edit] Propositional logic
- Boolean algebra (logic), an equational theory of truth values
- Logical connective
- Propositional calculus, on deductive systems for propositional logic
- Propositional formula
- Propositional variable
[edit] Computer science
- Boolean datatype
- Boolean domain, synonym for doubleton (two-element set)
- Boolean expression, very stubby
- Boolean function, about "efficient representations", defines "algebraic normal form" and "finitary boolean function".
[edit] Boolean functions
- Boolean-valued function
- Finitary boolean function
- Propositional representation, in very rough shape
- Standard Boolean model in information retrieval; in bad shape
- Truth function
[edit] Disambiguation pages
[edit] Redirects
[edit] Boolean algebra
[edit] Boolean functions and connectives
| Click show to expand |
|---|
[edit] Propositional logic
| Click show to expand |
|---|
|
[edit] Computer science
| Click show to expand |
|---|
[edit] Lists from Special:Prefixindex
- Articles beginning with 'Boolean'
- Articles beginning with 'Logical'
- Articles beginning with 'Proposition'
[edit] Wikiprojects
- Computer Science (talk)
- Logic (talk)
- Mathematics (talk)
- Philosophy (talk)
[edit] Interested Wikipedians
If you are interested in this subject and would like to participate in the discussions or be notified when proposals are ready, please add your name to the list below (the code ~~~ will add the name portion of your signature with no timestamp). You may also want to add this page to your watchlist, or monitor this page and the discussion page for changes.
- Carl (CBM · talk)
- Hans Adler (talk)
- Pomte (talk · contribs)
- David Eppstein (talk)
- Lambiam
- Paul August ☎
- Vaughan Pratt (talk)
- Trovatore (talk)
- Geometry guy
