Triple

T17607989
Position Surface form Disambiguated ID Type / Status
Subject De Morgan's laws E428884 entity
Predicate generalizationOf P2372 FINISHED
Object De Morgan's laws for propositions 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: De Morgan's laws for propositions | Statement: [De Morgan's laws, generalizationOf, De Morgan's laws for propositions]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: De Morgan's laws for propositions
Context triple: [De Morgan's laws, generalizationOf, De Morgan's laws for propositions]
  • A. De Morgan's laws chosen
    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. Boolean algebra
    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.
  • C. law of excluded middle
    The law of excluded middle is a classical logical principle stating that every proposition is either true or false, with no third option, and is central to debates between classical and intuitionistic logic.
  • D. Herbrand disjunction
    Herbrand disjunction is a logical formula formed as a finite disjunction of ground instances of a first-order formula, central to Herbrand’s theorem in proof theory and automated reasoning.
  • E. Bochvar three-valued logic
    Bochvar three-valued logic is a paraconsistent logical system that introduces a third truth value to handle semantic paradoxes and meaningless statements by preventing them from yielding classical logical consequences.
  • 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_69d889e1c6148190ba76241e74688f8b completed April 10, 2026, 5:25 a.m.
NER Named-entity recognition batch_69e46c4d8374819097cb112fba405e77 completed April 19, 2026, 5:46 a.m.
Created at: April 10, 2026, 5:51 a.m.