Triple
T2139597
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jacques Herbrand |
E46730
|
entity |
| Predicate | developedConcept |
P73
|
FINISHED |
| Object |
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.
|
E238239
|
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 disjunction | Statement: [Jacques Herbrand, developedConcept, Herbrand disjunction]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Herbrand disjunction Context triple: [Jacques Herbrand, developedConcept, Herbrand disjunction]
-
A.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
B.
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.
-
C.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
D.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
E.
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.
- 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 disjunction Triple: [Jacques Herbrand, developedConcept, Herbrand disjunction]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Herbrand disjunction Target entity description: 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.
-
A.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
B.
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.
-
C.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
D.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
E.
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.
- 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.