Triple
T568428
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | liar paradox |
E13608
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
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.
|
E71179
|
NE FINISHED |
How this triple was built (4 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: [liar paradox, 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: [liar paradox, relatedTo, Tarski's undefinability theorem]
-
A.
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.
-
B.
Remarks on the Foundations of Mathematics
Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
-
C.
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.
-
D.
von Neumann paradox in set theory
The von Neumann paradox in set theory is a foundational result showing that, under certain group-theoretic conditions, a set can be decomposed and reassembled into paradoxical subsets of equal “size,” illustrating the counterintuitive consequences of the axiom of choice.
-
E.
Russell’s paradox
Russell’s paradox is a foundational logical contradiction in naive set theory that reveals problems with sets that contain themselves, leading to major developments in modern logic and the axiomatization of set theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Tarski's undefinability theorem Triple: [liar paradox, relatedTo, Tarski's undefinability theorem]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Tarski's undefinability theorem Target entity description: 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.
-
A.
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.
-
B.
Remarks on the Foundations of Mathematics
Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
-
C.
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.
-
D.
von Neumann paradox in set theory
The von Neumann paradox in set theory is a foundational result showing that, under certain group-theoretic conditions, a set can be decomposed and reassembled into paradoxical subsets of equal “size,” illustrating the counterintuitive consequences of the axiom of choice.
-
E.
Russell’s paradox
Russell’s paradox is a foundational logical contradiction in naive set theory that reveals problems with sets that contain themselves, leading to major developments in modern logic and the axiomatization of set theory.
- F. None of above. chosen
Provenance (5 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_69a4933fa4d88190a7949cc83c08c5c1 |
completed | March 1, 2026, 7:27 p.m. |
| NER | Named-entity recognition | batch_69a49b0406d481908af5fc7bc67103fb |
completed | March 1, 2026, 8:01 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a4efd0d5b88190a8c0822800f48e2a |
completed | March 2, 2026, 2:02 a.m. |
| NEDg | Description generation | batch_69a4f043efec8190a3f53ab2764252be |
completed | March 2, 2026, 2:04 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69a4f3eb1e3481909aa2b8290ed99e49 |
completed | March 2, 2026, 2:20 a.m. |
Created at: March 1, 2026, 7:33 p.m.