User blog:Ubersketch/CNF in my FSS definition

https://googology.wikia.org/wiki/User_blog:Ubersketch/Formal_definition_for_a_fundamental_sequence_system

Cantor's normal form is an ordered 3-tuple (O, F, a[n])
 * 0 is in O
 * f(a) is in O if and only if f(a) is in F
 * f(a) is in F if and only if
 * f(a) = w^a or
 * f(a) = a+b where b is in O or
 * f(a) = g(h(a)) where g(a) and h(a) are in O
 * a+w^0=S(a)
 * w^(a+w^0)[n]=w^a+w^a+w^a... with n w^a
 * w^a[n]=w^(a[n])
 * a is in P_b if and only if
 * S(b)=a
 * S(c)=a where c is in P_b
 * There exists a in O and natural number n such that b[n]=a
 * a+b[n]=b[n] if a is in P_b, else a+b[n]=a+(b[n])