Triple

T17871997
Position Surface form Disambiguated ID Type / Status
Subject Löwenheim–Skolem theorem E446857 entity
Predicate involves P1256 FINISHED
Object Skolem hulls 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: Skolem hulls | Statement: [Löwenheim–Skolem theorem, involves, Skolem hulls]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Skolem hulls
Context triple: [Löwenheim–Skolem theorem, involves, Skolem hulls]
  • A. 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.
  • 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. 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.
  • D. Ł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.
  • E. Hamilton’s compactness theorem
    Hamilton’s compactness theorem is a fundamental result in geometric analysis that provides conditions under which a sequence of Riemannian manifolds with controlled curvature and injectivity radius admits a smoothly convergent subsequence.
  • 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: Skolem hulls
Target entity description: Skolem hulls are the smallest substructures of a model that contain a given set of elements and are closed under all definable Skolem functions, playing a key role in constructing countable elementary submodels in model theory.
  • A. 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.
  • 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. 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.
  • D. Ł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.
  • E. Hamilton’s compactness theorem
    Hamilton’s compactness theorem is a fundamental result in geometric analysis that provides conditions under which a sequence of Riemannian manifolds with controlled curvature and injectivity radius admits a smoothly convergent subsequence.
  • 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_69e49aa30ff8819090c51c1d7767e952 completed April 19, 2026, 9:04 a.m.
Created at: April 10, 2026, 10:18 a.m.