Triple

T2139570
Position Surface form Disambiguated ID Type / Status
Subject Jacques Herbrand E46730 entity
Predicate knownFor P22 FINISHED
Object 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.
E238235 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 universe | Statement: [Jacques Herbrand, knownFor, Herbrand universe]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Herbrand universe
Context triple: [Jacques Herbrand, knownFor, Herbrand universe]
  • A. von Neumann universe
    The von Neumann universe is a cumulative, well-founded hierarchy of sets used as a standard model of the set-theoretic universe in axiomatic set theory.
  • B. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • C. Tarski's undefinability theorem
    Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
  • D. Jacques Herbrand
    Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
  • E. completeness theorem for first-order logic
    The completeness theorem for first-order logic is a fundamental result in mathematical logic, proved by Kurt Gödel, which states that every logically valid first-order formula is provable from the axioms of first-order logic.
  • 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 universe
Triple: [Jacques Herbrand, knownFor, Herbrand universe]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Herbrand universe
Target entity description: 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.
  • A. von Neumann universe
    The von Neumann universe is a cumulative, well-founded hierarchy of sets used as a standard model of the set-theoretic universe in axiomatic set theory.
  • B. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • C. Tarski's undefinability theorem
    Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
  • D. Jacques Herbrand
    Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
  • E. completeness theorem for first-order logic
    The completeness theorem for first-order logic is a fundamental result in mathematical logic, proved by Kurt Gödel, which states that every logically valid first-order formula is provable from the axioms of first-order logic.
  • 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_69a88a174ab48190a5db20c132e5dccf completed March 4, 2026, 7:37 p.m.
NER Named-entity recognition batch_69abbe025d3c81908bcb33a7ff09eae8 completed March 7, 2026, 5:56 a.m.
NED1 Entity disambiguation (via context triple) batch_69ae51b1290c8190a08850b428c99a6c completed March 9, 2026, 4:50 a.m.
NEDg Description generation batch_69ae55923b748190bf7a2df3ae94edc8 completed March 9, 2026, 5:07 a.m.
NED2 Entity disambiguation (via description) batch_69ae55fdc32c8190b6ecdc9b23d64cc5 completed March 9, 2026, 5:09 a.m.
Created at: March 4, 2026, 7:44 p.m.