Triple
T10462274
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thoralf Skolem |
E246704
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Skolem's paradox |
E446857
|
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: Skolem's paradox | Statement: [Thoralf Skolem, notableWork, Skolem's paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Skolem's paradox Context triple: [Thoralf Skolem, notableWork, Skolem's paradox]
-
A.
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.
-
B.
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.
-
C.
Löwenheim–Skolem theorem (via additional arguments)
chosen
The Löwenheim–Skolem theorem is a fundamental result in model theory stating that any first-order theory with an infinite model has models of all infinite cardinalities, leading to the so-called Skolem paradox about the existence of countable models of set theory.
-
D.
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.
-
E.
Cantor’s paradox
Cantor’s paradox is a foundational result in set theory showing that the “set of all sets” cannot exist because its power set would have a strictly larger cardinality, leading to a contradiction.
- 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_69d381c16c248190a2fe5b471e584e9c |
completed | April 6, 2026, 9:49 a.m. |
| NER | Named-entity recognition | batch_69d50884fac48190af22e181b1492557 |
completed | April 7, 2026, 1:37 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d89fcc84b48190a39de0d9b9111ebd |
completed | April 10, 2026, 6:59 a.m. |
Created at: April 6, 2026, 12:19 p.m.