Triple

T17872001
Position Surface form Disambiguated ID Type / Status
Subject Löwenheim–Skolem theorem E446857 entity
Predicate appliesTo P1129 FINISHED
Object first-order Zermelo–Fraenkel set theory NE NERFINISHED

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: first-order Zermelo–Fraenkel set theory | Statement: [Löwenheim–Skolem theorem, appliesTo, first-order Zermelo–Fraenkel set theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: first-order Zermelo–Fraenkel set theory
Context triple: [Löwenheim–Skolem theorem, appliesTo, first-order Zermelo–Fraenkel set theory]
  • A. Zermelo–Fraenkel set theory chosen
    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.
  • B. 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.
  • C. von Neumann–Bernays–Gödel set theory
    Von Neumann–Bernays–Gödel set theory is an axiomatic set theory extending Zermelo–Fraenkel set theory by formally distinguishing between sets and classes, widely used in foundational studies of mathematics.
  • D. 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.
  • E. Morse–Kelley set theory by class–set distinction
    Morse–Kelley set theory by class–set distinction is a foundational system that avoids certain set-theoretic paradoxes by rigorously distinguishing between sets and proper classes within a powerful axiomatic framework.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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.