Triple

T18458753
Position Surface form Disambiguated ID Type / Status
Subject Alfred Tarski E450973 entity
Predicate notableWork P4 FINISHED
Object Tarski’s undefinability theorem — NE NERFINISHED

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: [Alfred Tarski, notableWork, Tarski’s undefinability theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Tarski’s undefinability theorem
Context triple: [Alfred Tarski, notableWork, 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. Rosser’s trick in incompleteness proofs
    Rosser’s trick in incompleteness proofs is a refinement of Gödel’s incompleteness argument that strengthens the result by avoiding the need for the assumption that the underlying formal system is ω-consistent.
  • 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. 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.
  • 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 (2 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_69d8d38345688190b565eac2e4cd7935 completed April 10, 2026, 10:40 a.m.
NER Named-entity recognition batch_69e52a7cdb5c8190a399f0e4052f7d1f completed April 19, 2026, 7:18 p.m.
Created at: April 10, 2026, 11:33 a.m.