Triple
T15785612
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | New Foundations for Mathematical Logic |
E382730
|
entity |
| Predicate | field |
P3
|
FINISHED |
| Object | set theory |
E85409
|
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: set theory | Statement: [New Foundations for Mathematical Logic, field, set theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: set theory Context triple: [New Foundations for Mathematical Logic, field, set theory]
-
A.
set theory
chosen
Set theory is a foundational branch of mathematical logic that studies collections of objects, called sets, and underpins much of modern mathematics.
-
B.
Zermelo–Fraenkel set theory
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.
-
C.
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.
-
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.
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.
- 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_69d86da16e188190b89af699f1ed0bfe |
completed | April 10, 2026, 3:25 a.m. |
| NER | Named-entity recognition | batch_69e0540380448190a025338f0e62e6d1 |
completed | April 16, 2026, 3:14 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ff90a4661481909d04bcb9f5043a6b |
completed | May 9, 2026, 7:53 p.m. |
Created at: April 10, 2026, 4:48 a.m.