Triple
T739686
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | von Neumann paradox in set theory |
E15214
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Hausdorff paradox
The Hausdorff paradox is a result in set theory and geometry showing that a solid sphere in three-dimensional space can be decomposed into a finite number of disjoint pieces that can be reassembled, using only rotations, into two spheres identical to the original.
|
E15214
|
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: Hausdorff paradox | Statement: [von Neumann paradox in set theory, relatedTo, Hausdorff paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hausdorff paradox Context triple: [von Neumann paradox in set theory, relatedTo, Hausdorff paradox]
-
A.
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.
-
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.
Burali-Forti paradox
The Burali-Forti paradox is a foundational logical contradiction in set theory that arises from considering the set of all ordinal numbers, showing that such a totality cannot consistently exist as a set.
-
D.
Brouwer fixed-point theorem
The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
-
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: Hausdorff paradox Triple: [von Neumann paradox in set theory, relatedTo, Hausdorff paradox]
Generated description
The Hausdorff paradox is a result in set theory and geometry showing that a solid sphere in three-dimensional space can be decomposed into a finite number of disjoint pieces that can be reassembled, using only rotations, into two spheres identical to the original.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hausdorff paradox Target entity description: The Hausdorff paradox is a result in set theory and geometry showing that a solid sphere in three-dimensional space can be decomposed into a finite number of disjoint pieces that can be reassembled, using only rotations, into two spheres identical to the original.
-
A.
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.
-
B.
von Neumann paradox in set theory
chosen
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.
Burali-Forti paradox
The Burali-Forti paradox is a foundational logical contradiction in set theory that arises from considering the set of all ordinal numbers, showing that such a totality cannot consistently exist as a set.
-
D.
Brouwer fixed-point theorem
The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
-
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.
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_69a49358aa308190adbc9b5a0a2adcf9 |
completed | March 1, 2026, 7:28 p.m. |
| NER | Named-entity recognition | batch_69a4a5f3b6388190b5ca3fa31416b61a |
completed | March 1, 2026, 8:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a654e40b9c8190ab4314e63826d00a |
completed | March 3, 2026, 3:26 a.m. |
| NEDg | Description generation | batch_69a65566f6848190a50c39d1fad2b42b |
completed | March 3, 2026, 3:28 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69a655f9c0f081909d0ede1c1b515f25 |
completed | March 3, 2026, 3:31 a.m. |
Created at: March 1, 2026, 7:37 p.m.