Boolean algebra
E883488
Boolean algebra is a branch of algebraic logic that studies variables and operations based on two values, typically true and false, forming the mathematical foundation of digital circuits and classical logic.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| Boolean logic | 1 |
Statements (52)
| Predicate | Object |
|---|---|
| instanceOf |
algebraic structure
ⓘ
branch of algebra ⓘ branch of mathematical logic ⓘ |
| axiomatizedBy |
absorption laws
ⓘ
associativity ⓘ commutativity ⓘ complement laws ⓘ distributivity ⓘ idempotent laws ⓘ identity laws ⓘ |
| canonicalExample |
power set algebra
ⓘ
two-element Boolean algebra ⓘ |
| developedBy | George Boole NERFINISHED ⓘ |
| fieldOfStudy |
computer science
ⓘ
electrical engineering ⓘ information theory NERFINISHED ⓘ logic ⓘ |
| foundationOf |
classical computation
ⓘ
digital circuit design ⓘ digital electronics ⓘ switching theory ⓘ |
| furtherDevelopedBy |
Augustus De Morgan
NERFINISHED
ⓘ
Charles Sanders Peirce NERFINISHED ⓘ Ernst Schröder NERFINISHED ⓘ |
| hasConstant |
0
ⓘ
1 ⓘ |
| hasDomain | set of truth values ⓘ |
| hasOperation |
conjunction
ⓘ
disjunction ⓘ exclusive OR ⓘ implication ⓘ logical AND ⓘ logical NOT ⓘ logical OR ⓘ negation ⓘ |
| hasProperty |
bounded lattice
ⓘ
complemented lattice ⓘ distributive lattice ⓘ |
| models | classical propositional logic ⓘ |
| namedAfter | George Boole NERFINISHED ⓘ |
| relatedTo |
Boolean ring
ⓘ
propositional calculus ⓘ set theory NERFINISHED ⓘ |
| typicalValues |
false
ⓘ
true ⓘ |
| usedIn |
combinational circuits
ⓘ
computer architecture ⓘ database query optimization ⓘ formal verification ⓘ logic gates ⓘ search algorithms ⓘ sequential circuits ⓘ |
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
John Venn
this entity surface form:
Boolean logic
subject surface form:
Digital computer