Triple

T9809810
Position Surface form Disambiguated ID Type / Status
Subject Herbrand disjunction E238239 entity
Predicate hasOppositeConcept P11522 FINISHED
Object Herbrand conjunction (for universal formulas)
A Herbrand conjunction (for universal formulas) is a finite conjunction of ground instances of a universally quantified formula, used in Herbrand’s theorem and automated reasoning to represent universal information over a Herbrand universe.
E822898 NE FINISHED

How this triple was built (4 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: Herbrand conjunction (for universal formulas) | Statement: [Herbrand disjunction, hasOppositeConcept, Herbrand conjunction (for universal formulas)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Herbrand conjunction (for universal formulas)
Context triple: [Herbrand disjunction, hasOppositeConcept, Herbrand conjunction (for universal formulas)]
  • A. 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.
  • B. Herbrand universe
    The Herbrand universe is a fundamental concept in mathematical logic and automated theorem proving, consisting of all ground (variable-free) terms that can be built from the function symbols and constants of a given first-order language.
  • C. Herbrand's theorem
    Herbrand's theorem is a fundamental result in mathematical logic and proof theory that characterizes the validity of first-order formulas via finite sets of ground instances, forming a basis for automated theorem proving.
  • D. Herbrand expansion
    Herbrand expansion is a method in mathematical logic that transforms first-order formulas into equivalent (often infinite) propositional combinations by systematically instantiating quantified variables with terms from the Herbrand universe.
  • E. Herbrand function
    The Herbrand function is a numerical tool in local class field theory that measures the ramification filtration of Galois groups, playing a key role in understanding how ramification behaves in extensions of local fields.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Herbrand conjunction (for universal formulas)
Triple: [Herbrand disjunction, hasOppositeConcept, Herbrand conjunction (for universal formulas)]
Generated description
A Herbrand conjunction (for universal formulas) is a finite conjunction of ground instances of a universally quantified formula, used in Herbrand’s theorem and automated reasoning to represent universal information over a Herbrand universe.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Herbrand conjunction (for universal formulas)
Target entity description: A Herbrand conjunction (for universal formulas) is a finite conjunction of ground instances of a universally quantified formula, used in Herbrand’s theorem and automated reasoning to represent universal information over a Herbrand universe.
  • A. 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.
  • B. Herbrand universe
    The Herbrand universe is a fundamental concept in mathematical logic and automated theorem proving, consisting of all ground (variable-free) terms that can be built from the function symbols and constants of a given first-order language.
  • C. Herbrand's theorem
    Herbrand's theorem is a fundamental result in mathematical logic and proof theory that characterizes the validity of first-order formulas via finite sets of ground instances, forming a basis for automated theorem proving.
  • D. Herbrand expansion
    Herbrand expansion is a method in mathematical logic that transforms first-order formulas into equivalent (often infinite) propositional combinations by systematically instantiating quantified variables with terms from the Herbrand universe.
  • E. Herbrand function
    The Herbrand function is a numerical tool in local class field theory that measures the ramification filtration of Galois groups, playing a key role in understanding how ramification behaves in extensions of local fields.
  • F. None of above. chosen

Provenance (5 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_69ca84defac48190abc1148804f184c1 completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb220310c8190a16ca0b746f0ef7a completed April 2, 2026, 12:02 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1cc5b4dd8819088c86946b4eb8a39 completed April 5, 2026, 2:43 a.m.
NEDg Description generation batch_69d1cd7f41448190b387109235dbc7f5 completed April 5, 2026, 2:48 a.m.
NED2 Entity disambiguation (via description) batch_69d1cdefca5c8190a673caca42aaa7d0 completed April 5, 2026, 2:50 a.m.
Created at: March 30, 2026, 8:29 p.m.