Triple

T8850216
Position Surface form Disambiguated ID Type / Status
Subject Hilbert’s second problem E210618 entity
Predicate connectedToResult P845 FINISHED
Object 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 ε₀.
E761263 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: Gentzen’s consistency proof for arithmetic | Statement: [Hilbert’s second problem, connectedToResult, Gentzen’s consistency proof for arithmetic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Gentzen’s consistency proof for arithmetic
Context triple: [Hilbert’s second problem, connectedToResult, Gentzen’s consistency proof for arithmetic]
  • A. 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.
  • 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. Lectures on the Logic of Arithmetic
    Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
  • D. Hilbert-style deductive systems
    Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • E. 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.
  • 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: Gentzen’s consistency proof for arithmetic
Triple: [Hilbert’s second problem, connectedToResult, Gentzen’s consistency proof for arithmetic]
Generated description
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 ε₀.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Gentzen’s consistency proof for arithmetic
Target entity description: 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 ε₀.
  • A. 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.
  • 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. Lectures on the Logic of Arithmetic
    Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
  • D. Hilbert-style deductive systems
    Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • E. 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.
  • 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_69ca838a424c8190b1ecac115c2927e7 completed March 30, 2026, 2:07 p.m.
NER Named-entity recognition batch_69cc60abb0748190af41d4e1f419e39c completed April 1, 2026, 12:02 a.m.
NED1 Entity disambiguation (via context triple) batch_69cf89cb853c8190a7664f2e7de0de87 completed April 3, 2026, 9:35 a.m.
NEDg Description generation batch_69cf8ab7da348190b423f0768fe9dc1a completed April 3, 2026, 9:39 a.m.
NED2 Entity disambiguation (via description) batch_69cf8bd252a4819098891bbb67baf897 completed April 3, 2026, 9:43 a.m.
Created at: March 30, 2026, 6:49 p.m.