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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Boolean algebra canonical | 3 |
| Boolean logic | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10733086 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Boolean algebra Context triple: [Leibnizian logic, relatedTo, Boolean algebra]
-
A.
De Morgan's laws
De Morgan's laws are fundamental rules in Boolean algebra and set theory that relate conjunctions and disjunctions through negation, forming a cornerstone of classical logic.
-
B.
Kleene algebra
Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
-
C.
OBDDs
OBDDs (Ordered Binary Decision Diagrams) are a canonical, graph-based representation of Boolean functions that enables efficient manipulation and verification in formal methods and model checking.
-
D.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
-
E.
Description Logic
Description Logic is a family of formal knowledge representation languages used to model and reason about the concepts and relationships within a domain, forming the logical foundation of ontology languages like OWL.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Boolean algebra Target entity description: 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.
-
A.
De Morgan's laws
De Morgan's laws are fundamental rules in Boolean algebra and set theory that relate conjunctions and disjunctions through negation, forming a cornerstone of classical logic.
-
B.
Kleene algebra
Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
-
C.
OBDDs
OBDDs (Ordered Binary Decision Diagrams) are a canonical, graph-based representation of Boolean functions that enables efficient manipulation and verification in formal methods and model checking.
-
D.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
-
E.
Description Logic
Description Logic is a family of formal knowledge representation languages used to model and reason about the concepts and relationships within a domain, forming the logical foundation of ontology languages like OWL.
- F. None of above. chosen
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 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Boolean algebra Description of subject: 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.
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