Triple
T10829113
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Veblen hierarchy |
E255569
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Bachmann–Howard ordinal
The Bachmann–Howard ordinal is a large countable ordinal that serves as a key benchmark in proof theory, marking the strength of powerful formal systems extending predicative arithmetic.
|
E890897
|
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: Bachmann–Howard ordinal | Statement: [Veblen hierarchy, relatedTo, Bachmann–Howard ordinal]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bachmann–Howard ordinal Context triple: [Veblen hierarchy, relatedTo, Bachmann–Howard ordinal]
-
A.
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.
-
B.
Cantor normal form
Cantor normal form is a canonical way of expressing any ordinal number as a finite sum of decreasing powers of the first infinite ordinal ω with natural number coefficients.
-
C.
Graham's number
Graham's number is an extraordinarily large number that arose in a problem in Ramsey theory and became famous as one of the largest numbers ever used in a serious mathematical proof.
-
D.
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.
-
E.
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.
- 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: Bachmann–Howard ordinal Triple: [Veblen hierarchy, relatedTo, Bachmann–Howard ordinal]
Generated description
The Bachmann–Howard ordinal is a large countable ordinal that serves as a key benchmark in proof theory, marking the strength of powerful formal systems extending predicative arithmetic.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bachmann–Howard ordinal Target entity description: The Bachmann–Howard ordinal is a large countable ordinal that serves as a key benchmark in proof theory, marking the strength of powerful formal systems extending predicative arithmetic.
-
A.
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.
-
B.
Cantor normal form
Cantor normal form is a canonical way of expressing any ordinal number as a finite sum of decreasing powers of the first infinite ordinal ω with natural number coefficients.
-
C.
Graham's number
Graham's number is an extraordinarily large number that arose in a problem in Ramsey theory and became famous as one of the largest numbers ever used in a serious mathematical proof.
-
D.
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.
-
E.
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.
- 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_69d6aa8081448190a9324184f2bd1c26 |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d734d3eab88190b30a3025b6b2b0bc |
completed | April 9, 2026, 5:10 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69dff7c45f288190a5235b5d7000a32c |
completed | April 15, 2026, 8:40 p.m. |
| NEDg | Description generation | batch_69e0026e7900819087327db5f625169c |
completed | April 15, 2026, 9:26 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e0057a7704819096becb74dc261883 |
completed | April 15, 2026, 9:39 p.m. |
Created at: April 8, 2026, 9:19 p.m.