Triple

T3380879
Position Surface form Disambiguated ID Type / Status
Subject Tarski's undefinability theorem E71179 entity
Predicate relatedTo P37 FINISHED
Object Tarski's hierarchy of languages E71181 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 hierarchy of languages | Statement: [Tarski's undefinability theorem, relatedTo, Tarski's hierarchy of languages]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Tarski's hierarchy of languages
Context triple: [Tarski's undefinability theorem, relatedTo, Tarski's hierarchy of languages]
  • A. Tarskian object-language/metalanguage distinction chosen
    The Tarskian object-language/metalanguage distinction is a foundational semantic framework that separates the language in which statements are made from the higher-level language used to talk about and define their truth, thereby avoiding self-referential paradoxes like the liar paradox.
  • B. The Logical Syntax of Language
    The Logical Syntax of Language is Rudolf Carnap’s seminal 1934 work that systematically develops a formal, logical framework for analyzing the structure and rules of scientific languages, helping to found logical empiricism and modern philosophy of language.
  • C. 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.
  • D. 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.
  • E. Lectures on the Logic of Arithmetic
    Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
  • 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_69ad85a7f80c8190a05e43013f298942 completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb5e7c7f48190afb78c311b424c93 completed March 8, 2026, 5:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69b3344f9b448190aab1038ead60fa48 completed March 12, 2026, 9:46 p.m.
Created at: March 8, 2026, 3:14 p.m.