Triple
T10829076
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Veblen hierarchy |
E255569
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | hierarchy of ordinal functions |
C27362
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: hierarchy of ordinal functions Context triple: [Veblen hierarchy, instanceOf, hierarchy of ordinal functions]
-
A.
cumulative hierarchy
The cumulative hierarchy is a conceptual model of the set-theoretic universe built in transfinite stages, where each level consists of all sets that can be formed from the sets at earlier levels.
-
B.
hyperoperation notation
Hyperoperation notation is a systematic way of representing an infinite hierarchy of arithmetic operations (such as addition, multiplication, exponentiation, tetration, and beyond) using a unified symbolic scheme.
-
C.
fast-growing function
chosen
A fast-growing function is a mathematical function whose values increase more rapidly than those of standard elementary functions (like polynomials or exponentials), often outpacing any fixed level of such growth rates.
-
D.
axiomatic set theory
Axiomatic set theory is a branch of mathematical logic that studies sets and their relationships by formulating precise axioms to avoid paradoxes and provide a rigorous foundation for mathematics.
-
E.
hierarchy of formal grammars
A hierarchy of formal grammars is an organized classification of grammars into levels based on their generative power and structural constraints, such as the Chomsky hierarchy from regular to recursively enumerable languages.
- F. None of above.
Provenance (1 batch)
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. |
Created at: April 8, 2026, 9:19 p.m.