Triple
T10055641
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Grundzüge der theoretischen Logik |
E208853
|
entity |
| Predicate | era |
P200
|
FINISHED |
| Object | Hilbert program in the foundations of mathematics |
E41775
|
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: Hilbert program in the foundations of mathematics | Statement: [Grundzüge der theoretischen Logik, era, Hilbert program in the foundations of mathematics]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert program in the foundations of mathematics Context triple: [Grundzüge der theoretischen Logik, era, Hilbert program in the foundations of mathematics]
-
A.
Hilbert’s program
chosen
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.
-
B.
Remarks on the Foundations of Mathematics
Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
-
C.
Gentzen’s consistency proof for arithmetic
Gentzen’s consistency proof for arithmetic is a landmark 1930s result in proof theory that established the consistency of Peano arithmetic using transfinite induction up to the ordinal ε₀.
-
D.
Recherches sur la théorie de la démonstration
Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
-
E.
Introduction to Metamathematics
Introduction to Metamathematics is a classic 1952 textbook by Stephen Kleene that systematically develops the foundations of mathematical logic and recursion theory.
- 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_69ca836094408190a36a1ea7e9a86fcd |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cdcfacacd08190abe66f8bb17b92c7 |
completed | April 2, 2026, 2:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d2cba6971c819090689917cd9b5b7c |
completed | April 5, 2026, 8:52 p.m. |
Created at: March 30, 2026, 8:57 p.m.