Triple

T4165878
Position Surface form Disambiguated ID Type / Status
Subject axiom schema of separation E84443 entity
Predicate componentOf P35 FINISHED
Object Zermelo–Fraenkel axioms E13857 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: Zermelo–Fraenkel axioms | Statement: [axiom schema of separation, componentOf, Zermelo–Fraenkel axioms]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Zermelo–Fraenkel axioms
Context triple: [axiom schema of separation, componentOf, Zermelo–Fraenkel axioms]
  • 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. axiom of choice
    The axiom of choice is a fundamental principle in set theory asserting that one can select an element from each set in any collection of nonempty sets, with far-reaching consequences across mathematics.
  • E. 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.
  • 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_69aed932cab48190b80ffe35f7029ae1 completed March 9, 2026, 2:29 p.m.
NER Named-entity recognition batch_69af02ac8e788190a8f3563a2903bbad completed March 9, 2026, 5:26 p.m.
NED1 Entity disambiguation (via context triple) batch_69b5a84713f88190a051b7d94b89d585 completed March 14, 2026, 6:26 p.m.
Created at: March 9, 2026, 3:44 p.m.