Triple

T9809866
Position Surface form Disambiguated ID Type / Status
Subject The Undecidable E238241 entity
Predicate subject P450 FINISHED
Object Gödel’s incompleteness theorems E71396 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: Gödel’s incompleteness theorems | Statement: [The Undecidable, subject, Gödel’s incompleteness theorems]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Gödel’s incompleteness theorems
Context triple: [The Undecidable, subject, Gödel’s incompleteness theorems]
  • A. Gödel's incompleteness theorems chosen
    Gödel's incompleteness theorems are two fundamental results in mathematical logic showing that any sufficiently powerful, consistent formal system cannot prove all true statements about arithmetic, and cannot prove its own consistency.
  • 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. 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.
  • D. Incompleteness: The Proof and Paradox of Kurt Gödel
    Incompleteness: The Proof and Paradox of Kurt Gödel is a biographical and philosophical study that intertwines Kurt Gödel’s life with an accessible exploration of his incompleteness theorems and their broader intellectual implications.
  • E. 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 ε₀.
  • 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_69ca84defac48190abc1148804f184c1 completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb220310c8190a16ca0b746f0ef7a completed April 2, 2026, 12:02 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1cc5b4dd8819088c86946b4eb8a39 completed April 5, 2026, 2:43 a.m.
Created at: March 30, 2026, 8:29 p.m.