Triple
T16130500
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert Vaught |
E391382
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Vaught conjecture
The Vaught conjecture is an open problem in mathematical logic and model theory that predicts a precise restriction on the possible numbers of countable models of a complete first-order theory.
|
E1195794
|
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: Vaught conjecture | Statement: [Robert Vaught, notableWork, Vaught conjecture]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Vaught conjecture Context triple: [Robert Vaught, notableWork, Vaught conjecture]
-
A.
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.
-
B.
Kripke–Platek set theory
Kripke–Platek set theory is a weaker, predicative subsystem of Zermelo–Fraenkel set theory focused on sets that are explicitly constructible and often used in the study of admissible sets and recursion theory.
-
C.
Cardinal Invariants on Boolean Algebras
"Cardinal Invariants on Boolean Algebras" is a research monograph by set theorist J. Donald Monk that systematically studies cardinal characteristics associated with Boolean algebras and their connections to set theory and logic.
-
D.
Fraenkel–Mostowski permutation models
Fraenkel–Mostowski permutation models are set-theoretic constructions using permutations of atoms to demonstrate the independence of certain choice principles from Zermelo–Fraenkel set theory.
-
E.
Łoś–Tarski preservation theorem
The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
- 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: Vaught conjecture Triple: [Robert Vaught, notableWork, Vaught conjecture]
Generated description
The Vaught conjecture is an open problem in mathematical logic and model theory that predicts a precise restriction on the possible numbers of countable models of a complete first-order theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Vaught conjecture Target entity description: The Vaught conjecture is an open problem in mathematical logic and model theory that predicts a precise restriction on the possible numbers of countable models of a complete first-order theory.
-
A.
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.
-
B.
Kripke–Platek set theory
Kripke–Platek set theory is a weaker, predicative subsystem of Zermelo–Fraenkel set theory focused on sets that are explicitly constructible and often used in the study of admissible sets and recursion theory.
-
C.
Cardinal Invariants on Boolean Algebras
"Cardinal Invariants on Boolean Algebras" is a research monograph by set theorist J. Donald Monk that systematically studies cardinal characteristics associated with Boolean algebras and their connections to set theory and logic.
-
D.
Fraenkel–Mostowski permutation models
Fraenkel–Mostowski permutation models are set-theoretic constructions using permutations of atoms to demonstrate the independence of certain choice principles from Zermelo–Fraenkel set theory.
-
E.
Łoś–Tarski preservation theorem
The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
- 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_69d87f1bb0988190b490d273dbf3fd03 |
completed | April 10, 2026, 4:39 a.m. |
| NER | Named-entity recognition | batch_69e2020829e88190b51ab32d22cf0259 |
completed | April 17, 2026, 9:48 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fff2aff07c8190bf693f652e2a2808 |
completed | May 10, 2026, 2:51 a.m. |
| NEDg | Description generation | batch_69fff39371648190b3f694df00ff4f3e |
completed | May 10, 2026, 2:55 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69fff47a52cc8190b0ad7c37ea444159 |
completed | May 10, 2026, 2:59 a.m. |
Created at: April 10, 2026, 5:01 a.m.