Triple

T16130522
Position Surface form Disambiguated ID Type / Status
Subject Robert Vaught E391382 entity
Predicate knownFor P22 FINISHED
Object Vaught transform in logic E1195795 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: Vaught transform in logic | Statement: [Robert Vaught, knownFor, Vaught transform in logic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Vaught transform in logic
Context triple: [Robert Vaught, knownFor, Vaught transform in logic]
  • A. Vaught transforms in model theory chosen
    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.
  • B. 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.
  • C. Ł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.
  • 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. 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.
  • 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_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_69fffef0f51c8190bc039150af8ebf98 completed May 10, 2026, 3:43 a.m.
Created at: April 10, 2026, 5:01 a.m.