Triple

T14405323
Position Surface form Disambiguated ID Type / Status
Subject Grelling–Nelson paradox E357180 entity
Predicate relatedConcept P37 FINISHED
Object Tarski 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 undefinability theorem | Statement: [Grelling–Nelson paradox, relatedConcept, Tarski undefinability theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Tarski undefinability theorem
Context triple: [Grelling–Nelson paradox, relatedConcept, Tarski 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. 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.
  • C. 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.
  • 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. 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.
  • 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_69d82793421c8190861eb0e673b085de completed April 9, 2026, 10:26 p.m.
NER Named-entity recognition batch_69de908804048190a4fe58afc2e0a5b6 completed April 14, 2026, 7:07 p.m.
NED1 Entity disambiguation (via context triple) batch_69fd5523267081908d972b60b6039528 completed May 8, 2026, 3:14 a.m.
Created at: April 10, 2026, 1:17 a.m.