Triple
T17487366
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | The Logic of Relatives |
E425809
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Boolean algebra |
—
|
NE NERFINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Boolean algebra | Statement: [The Logic of Relatives, relatedTo, Boolean algebra]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Boolean algebra Context triple: [The Logic of Relatives, relatedTo, Boolean algebra]
-
A.
Boolean algebra
chosen
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.
-
B.
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.
-
C.
Handbook of Boolean Algebras
The *Handbook of Boolean Algebras* is a comprehensive multi-volume reference work that surveys the theory, structure, and applications of Boolean algebras in modern mathematics and logic.
-
D.
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.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d889dccf7481909264a1844a2e9100 |
completed | April 10, 2026, 5:25 a.m. |
| NER | Named-entity recognition | batch_69e451d2a5208190b25944626e779fdc |
completed | April 19, 2026, 3:53 a.m. |
Created at: April 10, 2026, 5:48 a.m.