Triple
T1396006
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Georg Cantor |
E30666
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Cantor–Bernstein–Schröder theorem
The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
|
E160401
|
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: Cantor–Bernstein–Schröder theorem | Statement: [Georg Cantor, knownFor, Cantor–Bernstein–Schröder theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Cantor–Bernstein–Schröder theorem Context triple: [Georg Cantor, knownFor, Cantor–Bernstein–Schröder theorem]
-
A.
Cantor’s theorem
Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
-
B.
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.
-
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.
Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
-
E.
Zermelo set theory
Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
- 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: Cantor–Bernstein–Schröder theorem Triple: [Georg Cantor, knownFor, Cantor–Bernstein–Schröder theorem]
Generated description
The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Cantor–Bernstein–Schröder theorem Target entity description: The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
-
A.
Cantor’s theorem
Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
-
B.
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.
-
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.
Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
-
E.
Zermelo set theory
Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
- 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_69a498fd4e408190bd73eca30ea9754c |
completed | March 1, 2026, 7:52 p.m. |
| NER | Named-entity recognition | batch_69a4c37fd6e0819084d610ef041db3af |
completed | March 1, 2026, 10:53 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69acde310f748190a5c58caf4fbaa5c5 |
completed | March 8, 2026, 2:25 a.m. |
| NEDg | Description generation | batch_69acdee073fc819098c906d91870b317 |
completed | March 8, 2026, 2:28 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ace0a7ddc08190a44be1707587351b |
completed | March 8, 2026, 2:36 a.m. |
Created at: March 1, 2026, 7:59 p.m.