Category:Boolean algebra
![]() | Computing portal |
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
Pages in category "Boolean algebra"
The following 91 pages are in this category, out of 91 total.
- Boolean algebra (computing)
- Boolean algebra (structure) (computing)
- List of Boolean algebra topics (computing)
2
- 2-valued morphism (computing)
A
- Absorption law (computing)
- Algebraic normal form (computing)
- Analysis of Boolean functions (computing)
B
- Balanced boolean function (computing)
- Bent function (computing)
- Binary decision diagram (computing)
- Bitwise operation (computing)
- Boole's expansion theorem (computing)
- George Boole (biography)
- Boolean algebras canonically defined (computing)
- Boolean conjunctive query (computing)
- Boolean data type (computing)
- Boolean domain (computing)
- Boolean expression (computing)
- Boolean function (computing)
- Boolean matrix (computing)
- Boolean prime ideal theorem (computing)
- Boolean ring (computing)
- Boolean satisfiability algorithm heuristics (computing)
- Boolean satisfiability problem (computing)
- Boolean-valued function (computing)
- Boolean-valued model (computing)
- Booleo (computing)
C
- Canonical normal form (computing)
- Cantor algebra (computing)
- Chaff algorithm (computing)
- Cohen algebra (computing)
- Collapsing algebra (computing)
- Complete Boolean algebra (computing)
- Consensus theorem (computing)
- Correlation immunity (computing)
D
- Davis–Putnam algorithm (computing)
- De Morgan's laws (computing)
- Derivative algebra (abstract algebra) (computing)
- DiVincenzo's criteria (computing)
E
- Evasive Boolean function (computing)
F
- Field of sets (computing)
- Formula game (computing)
- Free Boolean algebra (computing)
- Functional completeness (computing)
I
- Implicant (computing)
- Implication graph (computing)
- Inclusion (Boolean algebra) (computing)
- Interior algebra (computing)
K
- Karnaugh map (computing)
L
- Laws of Form (computing)
- Logic alphabet (computing)
- Logic optimization (computing)
- Logic redundancy (computing)
- Logical matrix (computing)
- Lupanov representation (computing)
M
- Maharam algebra (computing)
- Majority function (computing)
- Marquand diagram (computing)
- Minimal axioms for Boolean algebra (computing)
- Modal algebra (computing)
- Monadic Boolean algebra (computing)
P
- Parity function (computing)
- Petrick's method (computing)
- Planar SAT (computing)
- Poretsky's law of forms (computing)
- Product term (computing)
- Propositional calculus (computing)
- Propositional directed acyclic graph (computing)
- Propositional formula (computing)
Q
- Quine–McCluskey algorithm (computing)
R
- Random algebra (computing)
- Read-once function (computing)
- Reed–Muller expansion (computing)
- Relation algebra (computing)
- Residuated Boolean algebra (computing)
- Robbins algebra (computing)
S
- Sigma-algebra (computing)
- Stone functor (computing)
- Stone space (computing)
- Stone's representation theorem for Boolean algebras (computing)
- Suslin algebra (computing)
- Symmetric Boolean function (computing)
T
- Total operating characteristic (computing)
- True quantified Boolean formula (computing)
- Truth table (computing)
- Two-element Boolean algebra (computing)
V
- Vector logic (computing)
- Veitch chart (computing)
W
- Wolfram axiom (computing)
Z
- Zhegalkin polynomial (computing)
Σ
- Σ-algebra (computing)