Triple
T17872100
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | model theory |
E446859
|
entity |
| Predicate | hasKeyConcept |
P533
|
FINISHED |
| Object | Morley rank |
—
|
NE NERFINISHED |
How this triple was built (3 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: Morley rank | Statement: [model theory, hasKeyConcept, Morley rank]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Morley rank Context triple: [model theory, hasKeyConcept, Morley rank]
-
A.
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.
-
B.
Vaught transforms in model theory
Vaught transforms in model theory are a technical construction introduced by Robert Vaught that modify formulas to analyze their behavior across models, particularly in the study of completeness, definability, and related model-theoretic properties.
-
C.
Suslin rigidity theorem
The Suslin rigidity theorem is a fundamental result in algebraic K-theory asserting strong invariance (rigidity) properties of K-theory for certain rings or schemes under extensions or deformations.
-
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.
Ł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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Morley rank Target entity description: Morley rank is a model-theoretic notion of dimension that assigns an ordinal-valued measure of complexity to definable sets in a structure.
-
A.
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.
-
B.
Vaught transforms in model theory
Vaught transforms in model theory are a technical construction introduced by Robert Vaught that modify formulas to analyze their behavior across models, particularly in the study of completeness, definability, and related model-theoretic properties.
-
C.
Suslin rigidity theorem
The Suslin rigidity theorem is a fundamental result in algebraic K-theory asserting strong invariance (rigidity) properties of K-theory for certain rings or schemes under extensions or deformations.
-
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.
Ł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 (2 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_69d8b9f4c22c819093c2680434472894 |
completed | April 10, 2026, 8:51 a.m. |
| NER | Named-entity recognition | batch_69e49aa3cd248190a13a8209ba44fd3b |
completed | April 19, 2026, 9:04 a.m. |
Created at: April 10, 2026, 10:18 a.m.