Triple

T9809751
Position Surface form Disambiguated ID Type / Status
Subject Recherches sur la théorie de la démonstration E238238 entity
Predicate introducesConcept P201 FINISHED
Object Herbrand's theorem E238234 NE FINISHED

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: Herbrand's theorem | Statement: [Recherches sur la théorie de la démonstration, introducesConcept, Herbrand's theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Herbrand's theorem
Context triple: [Recherches sur la théorie de la démonstration, introducesConcept, Herbrand's theorem]
  • A. Herbrand's theorem chosen
    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.
  • B. Herbrand semantics
    Herbrand semantics is a formal framework in logic and automated theorem proving that interprets first-order formulas over the Herbrand universe of ground terms to define truth and satisfiability.
  • C. 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.
  • 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. Tarski–Mostowski–Robinson theorem
    The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69d22871bfe48190909467f07eda0118 completed April 5, 2026, 9:16 a.m.
Created at: March 30, 2026, 8:29 p.m.