User blog:Testitemqlstudop/FPT, large ordinals, ordinal FGH and a new Fundamental Sequence system

Prerequisite: https://testitem.github.io/colg/fpt.html

Here, I have basically made an OCF like a FGH for ordinals, and represented T as smallest fixed point of the OCF in question. Furthermore, I have given fundamental sequences to T and all ordinals reachable from T through indexing.

Two questions: What is T (relative to some other ordinal), and is fgh_T well-defined?

To extend on the fundamental sequence system:

If $a = a_0 + a_1 + a_2 + \dots + a_n$ where $a_0 > a_1 > a_2 > \dots > a_n$, then $a[i] = a_0 + a_1 + \dots + a_{n-1} + a_n[i]$.

Now to make Moosey mad we can make a new function, tttt(v) = dco(T+v) where dco is Moosey's decreasing ordinal function.