Triple
T10829101
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Veblen hierarchy |
E255569
|
entity |
| Predicate | canReach |
P95960
|
FINISHED |
| Object | Feferman–Schütte ordinal Γ₀ |
E513379
|
NE FINISHED |
How this triple was built (3 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: [Veblen hierarchy, canReach, Feferman–Schütte ordinal Γ₀]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Feferman–Schütte ordinal Γ₀ Context triple: [Veblen hierarchy, canReach, Feferman–Schütte ordinal Γ₀]
-
A.
Feferman–Schütte ordinal
chosen
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.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: canReach Context triple: [Veblen hierarchy, canReach, Feferman–Schütte ordinal Γ₀]
-
A.
tieneAlcance
Indicates that something possesses or has a certain scope, reach, or range of effect in relation to something else.
-
B.
canRefer
Indicates that one entity has the ability or permission to mention, point to, or direct attention to another entity.
-
C.
hasLongerReachThan
Indicates that one entity can extend, influence, or physically reach farther than another entity.
-
D.
canLeadTo
Indicates that one entity, condition, or event has the potential to cause, result in, or bring about another.
-
E.
accessibleFrom
Indicates that one entity can be reached, entered, or used starting from another entity, typically without obstruction.
- 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_69deb1096cbc81908f3eda562c2da042 |
completed | April 14, 2026, 9:26 p.m. |
| PD | Predicate disambiguation | batch_69d70d25280c8190b648d7d1958b413a |
completed | April 9, 2026, 2:21 a.m. |
| PDg | Predicate description generation | batch_69d7101c96708190808fef73199e8482 |
completed | April 9, 2026, 2:34 a.m. |
Created at: April 8, 2026, 9:19 p.m.