Category:Boolean algebra
From HandWiki
Here is a list of articles in the Boolean algebra category of the Computing portal that unifies foundations of mathematics and computations using computers. Boolean algebra can refer to:
- A calculus for the manipulation of truth values (T and F).
- A complemented distributive lattice. These can be used to model the operations on truth values.
Boolean algebra is intimately related to propositional logic (sentential logic) as well.
See also
Subcategories
This category has the following 2 subcategories, out of 2 total.
L
- Logical connectives (5 P)
N
- Normal forms (logic) (12 P)
Pages in category "Boolean algebra"
The following 98 pages are in this category, out of 98 total.
B
- Balanced boolean function
- Balanced Boolean function
- Bent function
- Binary decision diagram
- Bitwise operation
- Bitwise ternary logic instruction
- Boole's expansion theorem
- Biography:George Boole
- Boolean algebras canonically defined
- Boolean conjunctive query
- Boolean data type
- Boolean domain
- Boolean expression
- Boolean function
- Boolean prime ideal theorem
- Boolean ring
- Boolean satisfiability algorithm heuristics
- Boolean satisfiability problem
- Boolean-valued
- Boolean-valued function
- Boolean-valued model
- Booleo
