Triple

T17230046
Position Surface form Disambiguated ID Type / Status
Subject Hilbert-style deductive systems E418216 entity
Predicate historicalOrigin P1823 FINISHED
Object Hilbert’s program 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’s program | Statement: [Hilbert-style deductive systems, historicalOrigin, Hilbert’s program]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hilbert’s program
Context triple: [Hilbert-style deductive systems, historicalOrigin, Hilbert’s program]
  • 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. Hilbert’s second problem
    Hilbert’s second problem is one of David Hilbert’s famous list of 23 problems, asking for a proof of the consistency of arithmetic from a finite set of axioms using finitary methods.
  • D. Hilbert–Bernays derivability conditions
    The Hilbert–Bernays derivability conditions are a set of formal requirements on provability predicates in arithmetic that underpin key results in mathematical logic, including Gödel’s incompleteness theorems and Löb’s theorem.
  • E. Kronecker’s finitism
    Kronecker’s finitism is a philosophical and mathematical stance asserting that only finite, constructible mathematical objects and proofs are legitimate, rejecting the existence of actual infinities.
  • 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_69d886d8e96081909870bff6c3d0bf09 completed April 10, 2026, 5:12 a.m.
NER Named-entity recognition batch_69e42df62ec48190b2ed633a5bcc0255 completed April 19, 2026, 1:20 a.m.
NED1 Entity disambiguation (via context triple) batch_6a01675eae08819093427b4dc1ffee5f completed May 11, 2026, 5:21 a.m.
Created at: April 10, 2026, 5:39 a.m.