Triple

T3390152
Position Surface form Disambiguated ID Type / Status
Subject Gödel's incompleteness theorems E71396 entity
Predicate relatedTo P37 FINISHED
Object Tarski's undefinability theorem E71179 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: Tarski's undefinability theorem | Statement: [Gödel's incompleteness theorems, relatedTo, Tarski's undefinability theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Tarski's undefinability theorem
Context triple: [Gödel's incompleteness theorems, relatedTo, Tarski's undefinability theorem]
  • A. Tarski's undefinability theorem chosen
    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.
  • B. Gödel's incompleteness theorems
    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.
  • C. Tarski–Mostowski–Robinson theorem
    The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
  • D. Löb's theorem
    Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
  • E. Kripke fixed-point theory of truth
    The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar paradox.
  • 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_69ad85a9c4a88190a854019341cb3b60 completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb6682c708190b76a7a16cee7c5aa completed March 8, 2026, 5:48 p.m.
NED1 Entity disambiguation (via context triple) batch_69b360aded3c8190ab4ca37b4aead1df completed March 13, 2026, 12:56 a.m.
Created at: March 8, 2026, 3:14 p.m.