Triple
T5354241
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Solomon Feferman |
E102650
|
entity |
| Predicate | notableIdea |
P4
|
FINISHED |
| Object |
Feferman–Schütte ordinal
The Feferman–Schütte ordinal is a large countable ordinal that marks the proof-theoretic strength of predicative arithmetic and analysis, serving as a key boundary in ordinal analysis and foundations of mathematics.
|
E513379
|
NE FINISHED |
How this triple was built (4 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: Feferman–Schütte ordinal | Statement: [Solomon Feferman, notableIdea, Feferman–Schütte ordinal]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Feferman–Schütte ordinal Context triple: [Solomon Feferman, notableIdea, Feferman–Schütte ordinal]
-
A.
Ackermann function
The Ackermann function is a classic example of a computable function that grows faster than any primitive recursive function, often used in theoretical computer science to illustrate extreme computational complexity.
-
B.
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.
-
C.
Conway chained arrow notation
Conway chained arrow notation is a mathematical system of hyper-operator-style notation introduced by John Horton Conway to concisely represent extremely large numbers.
-
D.
Fraenkel
Fraenkel is a surname most prominently associated with Abraham Fraenkel, a German-Israeli mathematician known for his foundational work in axiomatic set 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. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Feferman–Schütte ordinal Triple: [Solomon Feferman, notableIdea, Feferman–Schütte ordinal]
Generated description
The Feferman–Schütte ordinal is a large countable ordinal that marks the proof-theoretic strength of predicative arithmetic and analysis, serving as a key boundary in ordinal analysis and foundations of mathematics.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Feferman–Schütte ordinal Target entity description: The Feferman–Schütte ordinal is a large countable ordinal that marks the proof-theoretic strength of predicative arithmetic and analysis, serving as a key boundary in ordinal analysis and foundations of mathematics.
-
A.
Ackermann function
The Ackermann function is a classic example of a computable function that grows faster than any primitive recursive function, often used in theoretical computer science to illustrate extreme computational complexity.
-
B.
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.
-
C.
Conway chained arrow notation
Conway chained arrow notation is a mathematical system of hyper-operator-style notation introduced by John Horton Conway to concisely represent extremely large numbers.
-
D.
Fraenkel
Fraenkel is a surname most prominently associated with Abraham Fraenkel, a German-Israeli mathematician known for his foundational work in axiomatic set 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. chosen
Provenance (5 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_69bd43d8f7248190b64c140734b5c9a8 |
completed | March 20, 2026, 12:55 p.m. |
| NER | Named-entity recognition | batch_69bd86149774819084049a8785e3f2e0 |
completed | March 20, 2026, 5:38 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf21dbc540819086aca16af1aa6213 |
completed | March 21, 2026, 10:55 p.m. |
| NEDg | Description generation | batch_69bf227781bc819083b8aba59618cc46 |
completed | March 21, 2026, 10:57 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69bf231d41848190b67de46bdbb38ab3 |
completed | March 21, 2026, 11 p.m. |
Created at: March 20, 2026, 2:01 p.m.