My system of number names (FGS)

Original of this publication (31.05.2016, my blog on googology.wikia)


==Section I. The fast-growing hierarchy==

The fast-growing hierarchy is defined as follows:

* <math>f_0(n) = n+1</math>

* <math>f_\alpha^{m+1}(n) = f_\alpha(f_\alpha^m(n))</math>

* <math>f_\alpha^0(n) = n</math>

* <math>f_{\alpha+1}(n) = f_\alpha^n(n)</math>

* <math>f_\alpha(n) = f_{\alpha[n]}(n)</math> if <math>\alpha</math> is a countable limit ordinal

where <math>n</math>, <math>m</math> are non-negative integers and <math>\alpha[n]</math> is the <math>n</math>-th element of the fundamental sequence assigned to the limit ordinal <math>\alpha</math>.

==Section II. Fundamental sequences for limit ordinals written in Cantor normal form==

Every nonzero ordinal <math>\alpha<\varepsilon_0</math> can be represented in a unique Cantor normal form <math>\alpha=\omega^{\beta_{1}}+ \omega^{\beta_{2}}+\cdots+\omega^{\beta_{k-1}}+\omega^{\beta_{k}}</math> where <math>\alpha>\beta_1\geq\beta_2\geq\cdots\geq\beta_{k-1}\geq\beta_k</math>. If <math>\beta_k>0</math> then <math>\alpha</math> is a limit and we can assign to it a fundamental sequence as follows

<math>\alpha[n]=\omega^{\beta_{1}}+ \omega^{\beta_{2}}+\cdots+\omega^{\beta_{k-1}}+\left\{\begin{array}{lcr} \omega^\gamma n \text{ if } \beta_k=\gamma+1\\ \omega^{\beta_k[n]} \text{ if } \beta_k \text{ is a limit}\\ \end{array}\right.</math>

Note: <math>\omega^0=1</math>

If <math>\alpha=\varepsilon_0</math> then <math>\alpha[0]=0</math> and <math>\alpha[n+1]=\omega^{\alpha[n]}</math>

==Section III. Fundamental sequences for the Veblen function==

Let <math>z</math> be an empty string or a string consisting of one or more comma-separated zeros <math>0,0,...,0</math> and <math>s</math> be an empty string or a string consisting of one or more comma-separated ordinals <math>\alpha _{1},\alpha _{2},...,\alpha _{n}</math> with <math>\alpha _{1}>0</math>. The binary function <math>\varphi (\beta ,\gamma )</math> can be written as <math>\varphi (s,\beta ,z,\gamma )</math> where both <math>s</math> and <math>z</math> are empty strings.

The finitary Veblen functions are defined as follows:

* <math>\varphi (\gamma )=\omega ^{\gamma }</math>

* <math>\varphi (z,s,\gamma )=\varphi (s,\gamma )</math>

* if <math>\beta >0</math>, then <math>\varphi (s,\beta ,z,\gamma )</math> denotes the <math>(1+\gamma )</math>-th common fixed point of the functions <math>\xi \mapsto \varphi (s,\delta ,\xi ,z)</math> for each <math>\delta <\beta</math>

Every non-zero ordinal <math>\alpha</math> less than the small Veblen ordinal (SVO) can be uniquely written in normal form for the finitary Veblen function:

<math>\alpha =\varphi (s_{1})+\varphi (s_{2})+\cdots +\varphi (s_{k})</math>

where

* <math>k</math> is a positive integer

* <math>\varphi (s_{1})\geq \varphi (s_{2})\geq \cdots \geq \varphi (s_{k})</math>

* <math>s_{m}</math> is a string consisting of one or more comma-separated ordinals <math>\alpha _{m,1},\alpha _{m,2},...,\alpha _{m,n_{m}}</math> where <math>\alpha _{m,1}>0</math> and each <math>\alpha _{m,i}<\varphi (s_{m})</math>

===Fundamental sequences for limit ordinals of finitary Veblen function===

Any countable limit ordinal has cofinality <math>\omega</math>. The fundamental sequence for an ordinal number <math>\alpha</math> with cofinality <math>\text{cof}(\alpha )=\omega</math> is a strictly increasing sequence <math>(\alpha [n])_{n<\omega }</math> with length <math>\omega</math> and with limit <math>\alpha</math>, where <math>\alpha [n]</math> is the <math>n</math>-th element of this sequence.

For limit ordinals <math>\alpha<SVO</math>, written in normal form for the finitary Veblen function:

* <math>(\varphi(s_1)+\varphi(s_2)+\cdots+\varphi(s_k))[n]=\varphi(s_1)+\varphi(s_2)+\cdots+\varphi(s_k)[n]</math>,

* <math>\varphi(\gamma)[n]=\left\{\begin{array}{lcr}

n \quad \text{if} \quad \gamma=1\\

\varphi(\gamma-1)\cdot n \quad \text{if} \quad \gamma \quad \text{is a successor ordinal}\\

\varphi(\gamma[n]) \quad \text{if} \quad \gamma \quad \text{is a limit ordinal}\\

\end{array}\right.

</math>,

* <math>\varphi(s,\beta,z,\gamma)[0]=0</math> and <math>\varphi(s,\beta,z,\gamma)[n+1]=\varphi(s,\beta-1,\varphi(s,\beta,z,\gamma)[n],z)</math> if <math>\gamma=0</math> and <math>\beta</math> is a successor ordinal,

* <math>\varphi(s,\beta,z,\gamma)[0]=\varphi(s,\beta,z,\gamma-1)+1</math> and <math>\varphi(s,\beta,z,\gamma)[n+1]=\varphi(s,\beta-1,\varphi(s,\beta,z,\gamma)[n],z)</math> if <math>\gamma</math> and <math>\beta</math> are successor ordinals,

* <math>\varphi(s,\beta,z,\gamma)[n]=\varphi(s,\beta,z,\gamma[n])</math> if <math>\gamma</math> is a limit ordinal,

* <math>\varphi(s,\beta,z,\gamma)[n]=\varphi(s,\beta[n],z,\gamma)</math> if <math>\gamma=0</math> and <math>\beta</math> is a limit ordinal,

* <math>\varphi(s,\beta,z,\gamma)[n]=\varphi(s,\beta[n],\varphi(s,\beta,z,\gamma-1)+1,z)</math> if <math>\gamma</math> is a successor ordinal and <math>\beta</math> is a limit ordinal.

==Section IV. The extended Wilfried Buchholz's functions==

===Definition of Buchholz's family of ordinal functions===

Buchholz defined his functions as follows:

* <math>C_\nu^0(\alpha) = \Omega_\nu</math>

* <math>C_\nu^{n+1}(\alpha) = C_\nu^n(\alpha) \cup \{\gamma | P(\gamma) \subseteq C_\nu^n(\alpha)\}\cup \{\psi_\mu(\xi) | \xi \in \alpha \cap C_\nu^n(\alpha) \wedge \xi \in C_\mu(\xi) \wedge \mu \leq \omega\}</math>

* <math>C_\nu(\alpha) = \bigcup_{n < \omega} C_\nu^n (\alpha) </math>

* <math>\psi_\nu(\alpha) = \min\{\gamma | \gamma \not\in C_\nu(\alpha)\} </math>

where

<math>\Omega_\nu=\left\{\begin{array}{lcr} 1\text{ if }\nu=0\\ \aleph_\nu\text{ if }\nu>0\\ \end{array}\right. </math>

and <math>P(\gamma)=\{\gamma_1,...,\gamma_k\}</math> is the set of additive principal numbers in form <math> \omega^\xi</math>

<math>P=\{\alpha\in On: 0<\alpha \wedge \forall \xi, \eta < \alpha (\xi+\eta < \alpha)\}=\{\omega^\xi: \xi \in On\}</math>

the sum of which gives this ordinal <math>\gamma</math>:

<math>\gamma=\alpha_1+\alpha_2+\cdots+\alpha_k</math> where <math>\alpha_1\geq\alpha_2\geq\cdots\geq\alpha_k</math> and <math>\alpha_1,\alpha_2,...,\alpha_k \in P(\gamma) </math>

Note: <math>On </math> denotes the class of all ordinals.

The limit of this notation is Takeuti-Feferman-Buchholz ordinal.

===Properties===

Buchholz showed following properties of those functions:

* <math>\psi_\nu(0)=\Omega_\nu</math>

* <math>\psi_\nu(\alpha)\in P</math>

* <math>\psi_\nu(\alpha+1)=\text{min}\{\gamma\in P: \psi_\nu(\alpha)<\gamma\}\text{ if }\alpha\in C_\nu(\alpha) </math>

* <math>\Omega_\nu\le\psi_\nu(\alpha)<\Omega_{\nu+1} </math>

* <math>\alpha\le\beta\Rightarrow\psi_\nu(\alpha)\le\psi_\nu(\beta) </math>

* <math>\psi_0(\alpha)=\omega^\alpha \text{ if }\alpha<\varepsilon_0</math>

* <math>\psi_\nu(\alpha)=\omega^{\Omega_\nu+\alpha} \text{ if }\alpha<\varepsilon_{\Omega_\nu+1} \text{ and } \nu\neq 0</math>

* <math>\theta(\varepsilon_{\Omega_\nu+1},0)=\psi_0(\varepsilon_{\Omega_\nu+1})</math> for <math>0<\nu\le\omega</math>

===The extended Wilfried Buchholz's functions===

We rewrite Buchholz's definition as follows:

* <math>C_\nu^0(\alpha) = \{\beta|\beta<\Omega_\nu\}</math>

* <math>C_\nu^{n+1}(\alpha) = \{\beta+\gamma,\psi_\mu(\eta)|\mu,\beta, \gamma,\eta\in C_{\nu}^n(\alpha)\wedge\eta<\alpha\}</math>

* <math>C_\nu(\alpha) = \bigcup_{n < \omega} C_\nu^n (\alpha)</math>

* <math>\psi_\nu(\alpha) = \min\{\gamma | \gamma \not\in C_\nu(\alpha)\}</math>

where

<math>\Omega_\nu=\left\{\begin{array}{lcr} 1\text{ if }\nu=0\\ \text{smallest ordinal with cardinality }\aleph_\nu \text{ if }\nu>0\\ \end{array}\right.</math>

and <math>\omega</math> is the smallest infinite ordinal.

There is only one little detail difference with original Buchholz definition: ordinal <math>\mu</math> is not limited by <math>\omega</math>, now ordinal <math>\mu</math> belongs to previous set <math>C_n</math>. Limit of this notation must be omega fixed point <math>\psi_0(\Omega_{\Omega_{\Omega_{...}}})=\psi_0(\psi_{\psi_{...}(0)}(0))</math>

===Normal form for the extended Wilfried Buchholz's functions===

The normal form for 0 is 0. If <math>\alpha</math> is a nonzero ordinal number <math>\alpha<\Lambda=\text{min}\{\beta|\psi_\beta(0)=\beta\}</math> then the normal form for <math>\alpha</math> is <math>\alpha=\psi_{\nu_1}(\beta_1)+\psi_{\nu_2}(\beta_2)+\cdots+\psi_{\nu_k}(\beta_k)</math> where <math>k</math> is a positive integer and <math>\psi_{\nu_1}(\beta_1)\geq\psi_{\nu_2}(\beta_2)\geq\cdots\geq\psi_{\nu_k}(\beta_k)</math> and each <math>\nu_i, \beta_i</math> are also written in normal form.

===Fundamental sequences for the extended Wilfried Buchholz's functions===

The fundamental sequence for an ordinal number <math>\alpha</math> with cofinality <math>\text{cof}(\alpha)=\beta</math> is a strictly increasing sequence <math>(\alpha[\eta])_{\eta<\beta}</math> with length <math>\beta</math> and with limit <math>\alpha</math>, where <math>\alpha[\eta]</math> is the <math>\eta</math>-th element of this sequence. If <math>\alpha</math> is a successor ordinal then <math>\text{cof}(\alpha)=1</math> and the fundamental sequence has only one element <math>\alpha[0]=\alpha-1</math>. If <math>\alpha</math> is a limit ordinal then <math>\text{cof}(\alpha)\in\{\omega\}\cup\{\Omega_{\mu+1}|\mu\geq 0\}</math>

For nonzero ordinals <math>\alpha<\Lambda</math>, written in normal form, fundamental sequences are defined as follows:

* If <math>\alpha=\psi_{\nu_1}(\beta_1)+\psi_{\nu_2}(\beta_2)+\cdots+\psi_{\nu_k}(\beta_k)</math> where <math>k\geq2</math> then <math>\text{cof}(\alpha)=\text{cof}(\psi_{\nu_k}(\beta_k))</math> and <math>\alpha[\eta]=\psi_{\nu_1}(\beta_1)+\cdots+\psi_{\nu_{k-1}}(\beta_{k-1})+(\psi_{\nu_k}(\beta_k)[\eta])</math>

* If <math>\alpha=\psi_{0}(0)=1</math>, then <math>\text{cof}(\alpha)=1</math> and <math>\alpha[0]=0</math>

* If <math>\alpha=\psi_{\nu+1}(0)</math>, then <math>\text{cof}(\alpha)=\Omega_{\nu+1}</math> and <math>\alpha[\eta]=\Omega_{\nu+1}[\eta]=\eta</math>

* If <math>\alpha=\psi_{\nu}(0)</math> and <math>\text{cof}(\nu)\in\{\omega\}\cup\{\Omega_{\mu+1}|\mu\geq 0\}</math>, then <math>\text{cof}(\alpha)=\text{cof}(\nu)</math> and <math>\alpha[\eta]=\psi_{\nu[\eta]}(0)=\Omega_{\nu[\eta]}</math>

* If <math>\alpha=\psi_{\nu}(\beta+1)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=\psi_{\nu}(\beta)\cdot \eta</math> (and note: <math>\psi_\nu(0)=\Omega_\nu</math>)

* If <math>\alpha=\psi_{\nu}(\beta)</math> and <math>\text{cof}(\beta)\in\{\omega\}\cup\{\Omega_{\mu+1}|\mu<\nu\}</math> then <math>\text{cof}(\alpha)=\text{cof}(\beta)</math> and <math>\alpha[\eta]=\psi_{\nu}(\beta[\eta])</math>

* If <math>\alpha=\psi_{\nu}(\beta)</math> and <math>\text{cof}(\beta)\in\{\Omega_{\mu+1}|\mu\geq\nu\}</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=\psi_{\nu}(\beta[\gamma[\eta]])</math> where <math>\left\{\begin{array}{lcr} \gamma[0]=\Omega_\mu \\ \gamma[\eta+1]=\psi_\mu(\beta[\gamma[\eta]])\\ \end{array}\right.</math>

If <math>\alpha=\Lambda</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=0</math> and <math>\alpha[\eta+1]=\psi_{\alpha[\eta]}(0)=\Omega_{\alpha[\eta]}</math>

==Section V. Fundamental sequences for the Hypcos's functions==

===Definition of the Hypcos's functions===

<math>\Omega_\alpha</math> with <math>\alpha>0</math> is the <math>\alpha</math>-th uncountable cardinal, <math>I_\alpha</math> with <math>\alpha>0</math> is the <math>\alpha</math>-th weakly inaccessible cardinal and for this notation <math>I_0=\Omega_0=0</math>

In this section the variables <math>\rho, \pi</math> are reserved for uncountable regular cardinals of the form <math>\Omega_{\nu+1}</math> or <math>I_{\mu+1}</math>

Then,

<math>C_0(\alpha,\beta) = \beta\cup\{0\}</math>

<math>C_{n+1}(\alpha,\beta) = \{\gamma+\delta|\gamma,\delta\in C_n(\alpha,\beta)\}</math>

<math>\cup \{\Omega_\gamma|\gamma\in C_n(\alpha,\beta)\}</math>

<math>\cup \{I_\gamma|\gamma\in C_n(\alpha,\beta)\}</math>

<math>\cup \{\psi_\pi(\gamma)|\pi,\gamma\in C_n(\alpha,\beta)\wedge\gamma<\alpha\}</math>

<math>C(\alpha,\beta) = \bigcup_{n<\omega} C_n(\alpha,\beta)</math>

<math>\psi_\pi(\alpha) = \min\{\beta<\pi|C(\alpha,\beta)\cap\pi\subseteq\beta\}</math>

===Properties===

* <math>\psi_{\pi}(0)=1</math>

* <math>\psi_{\Omega_1}(\alpha)=\omega^\alpha</math> for <math>\alpha<\varepsilon_0</math>

* <math>\psi_{\Omega_{\nu+1}}(\alpha)=\omega^{\Omega_\nu+\alpha}</math> for <math>1\le\alpha<\varepsilon_{\Omega_\nu+1}</math> and <math>\nu>0</math>

===Standard form for ordinals <math>\alpha<\beta=\text{min}\{\xi|I_\xi=\xi\}</math>===

* The standard form for 0 is 0

* If <math>\alpha</math> is of the form <math>\Omega_\beta</math>, then the standard form for <math>\alpha</math> is <math>\alpha= \Omega_\beta</math> where <math>\beta<\alpha</math> and <math>\beta</math> is expressed in standard form

* If <math>\alpha</math> is of the form <math>I_\beta</math>, then the standard form for <math>\alpha</math> is <math>\alpha= I_\beta</math> where <math>\beta<\alpha</math> and <math>\beta</math> is expressed in standard form

* If <math>\alpha</math> is not additively principal and <math>\alpha>0</math>, then the standard form for <math>\alpha</math> is <math>\alpha=\alpha_1+\alpha_2+\cdots+\alpha_n</math>, where the <math>\alpha_i</math> are principal ordinals with <math>\alpha_1\geq\alpha_2\geq\cdots\geq\alpha_n</math>, and the <math>\alpha_i</math> are expressed in standard form

* If <math>\alpha</math> is an additively principal ordinal but not of the form <math>\Omega_\beta</math> or <math>I_\gamma</math>, then <math>\alpha</math> is expressible in the form <math>\psi_\pi(\delta)</math>. Then the standard form for <math>\alpha</math> is <math>\alpha=\psi_\pi(\delta)</math> where <math>\pi</math> and <math>\delta</math> are expressed in standard form

===Fundamental sequences===

The fundamental sequence for an ordinal number <math>\alpha</math> with cofinality <math>\text{cof}(\alpha)=\beta</math> is a strictly increasing sequence <math>(\alpha[\eta])_{\eta<\beta}</math> with length <math>\beta</math> and with limit <math>\alpha</math>, where <math>\alpha[\eta]</math> is the <math>\eta</math>-th element of this sequence.

Let <math>S=\{\alpha|\text{cof}(\alpha)=1\}</math> and <math>L=\{\alpha|\text{cof}(\alpha)\geq\omega\}</math> where <math>S</math> denotes the set of successor ordinals and <math>L</math> denotes the set of limit ordinals.

For non-zero ordinals written in standard form fundamental sequences are defined as follows:

* If <math>\alpha=\alpha_1+\alpha_2+\cdots+\alpha_n</math> with <math>n\geq 2</math> then <math>\text{cof}(\alpha)=\text{cof}(\alpha_n)</math> and <math>\alpha[\eta]=\alpha_1+\alpha_2+\cdots+(\alpha_n[\eta])</math>

* If <math>\alpha=\psi_{\pi}(0)</math> then <math>\alpha=\text{cof}(\alpha)=1</math> and <math>\alpha[0]=0</math>

* If <math>\alpha=\psi_{\Omega_{\nu+1}}(1)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\left\{\begin{array}{lcr} \alpha[\eta]=\Omega_{\nu}\cdot\eta \text{ if }\nu>0 \\ \alpha[\eta]=\eta \text{ if }\nu=0\\ \end{array}\right.</math>

* If <math>\alpha=\psi_{\Omega_{\nu+1}}(\beta+1)</math> and <math>\beta\geq 1</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=\psi_{\Omega_{\nu+1}}(\beta)\cdot\eta</math>

* If <math>\alpha=\psi_{ I_{\nu+1}}(1)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=I_\nu+1</math> and <math>\alpha[\eta+1]=\Omega_{\alpha[\eta]}</math>

* If <math>\alpha=\psi_{ I_{\nu+1}}(\beta+1)</math> and <math>\beta\geq 1</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=\psi_{ I_{\nu+1}}(\beta)+1</math> and <math>\alpha[\eta+1]=\Omega_{\alpha[\eta]}</math>

* If <math>\alpha=\pi</math> then <math>\text{cof}(\alpha)=\pi</math> and <math>\alpha[\eta]=\eta</math>

* If <math>\alpha=\Omega_\nu</math> and <math>\nu\in L</math> then <math>\text{cof}(\alpha)=\text{cof}(\nu)</math> and <math>\alpha[\eta]=\Omega_{\nu[\eta]}</math>

* If <math>\alpha=I_\nu</math> and <math>\nu\in L</math> then <math>\text{cof}(\alpha)=\text{cof}(\nu)</math> and <math>\alpha[\eta]=I_{\nu[\eta]}</math>

* If <math>\alpha=\psi_\pi(\beta)</math> and <math>\omega\le\text{cof}(\beta)<\pi</math> then <math>\text{cof}(\alpha)=\text{cof}(\beta)</math> and <math>\alpha[\eta]=\psi_\pi(\beta[\eta])</math>

* If <math>\alpha=\psi_\pi(\beta)</math> and <math>\text{cof}(\beta)=\rho\geq\pi</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=\psi_\pi(\beta[\gamma[\eta]])</math> with <math>\gamma[0]=1</math> and <math>\gamma[\eta+1]=\psi_{\rho}(\beta[\gamma[\eta]])</math>

Limit of this notation is <math>\lambda</math>. If <math>\alpha=\lambda</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=1</math> and <math>\alpha[\eta+1]=I_{\alpha[\eta]}</math>

==Section VI. Fundamental sequences for the functions collapsing <math>\alpha</math>-weakly inaccessible cardinals==

===Definition of the functions collapsing <math>\alpha</math>-weakly inaccessible cardinals===

An ordinal is <math>\alpha</math>-weakly inaccessible if it's an uncountable regular cardinal and it's a limit of <math>\gamma</math>-weakly inaccessible cardinals for all <math>\gamma<\alpha</math>

Let <math>I(\alpha, 0)</math> be the first <math>\alpha</math>-weakly inaccessible cardinal, <math>I(\alpha, \beta+1)</math> be the next <math>\alpha</math>-weakly inaccessible cardinal after <math>I(\alpha,\beta)</math>, and <math>I(\alpha,\beta)=\sup\{I(\alpha,\gamma)|\gamma<\beta\}</math> for limit ordinal <math>\beta</math>

In this section the variables <math>\rho</math>, <math>\pi</math> are reserved for uncountable regular cardinals of the form <math>I(\alpha,0)</math> or <math>I(\alpha,\beta+1)</math>

Then,

<math>C_0(\alpha,\beta) = \beta\cup\{0\}</math>

<math>C_{n+1}(\alpha,\beta) = \{\gamma+\delta|\gamma,\delta\in C_n(\alpha,\beta)\}</math>

<math>\cup \{I(\gamma,\delta)|\gamma,\delta\in C_n(\alpha,\beta)\}</math>

<math>\cup \{\psi_\pi(\gamma)|\pi,\gamma\in C_n(\alpha,\beta)\wedge\gamma<\alpha\}</math>

<math>C(\alpha,\beta) = \bigcup_{n<\omega} C_n(\alpha,\beta)</math>

<math>\psi_\pi(\alpha) = \min\{\beta<\pi|C(\alpha,\beta)\cap\pi\subseteq\beta\}</math>

===Properties===

* <math>I(0,\alpha)=\Omega_{1+\alpha}=\aleph_{1+\alpha}</math>

* <math>I(1,\alpha)=I_{1+\alpha}</math>

* <math>\psi_{I(0,0)}(\alpha)=\omega^\alpha</math> for <math>\alpha<\varepsilon_0</math>

* <math>\psi_{I(0,\alpha+1)}(\beta)=\omega^{I(0,\alpha)+1+\beta}</math> for <math>\beta<\varepsilon_{I(0,\alpha)+1}</math>

===Standard form for ordinals <math>\alpha<\psi_{I(1,0,0)}(0)=\text{min}\{\xi|I(\xi,0)=\xi\}</math>===

* The standard form for 0 is 0

* If <math>\alpha</math> is of the form <math>I(\beta,\gamma)</math>, then the standard form for <math>\alpha</math> is <math>\alpha=I(\beta,\gamma)</math> where <math>\beta, \gamma<\alpha</math> and <math>\beta, \gamma</math> are expressed in standard form

* If <math>\alpha</math> is not additively principal and <math>\alpha>0</math>, then the standard form for <math>\alpha</math> is <math>\alpha=\alpha_1+\alpha_2+\cdots+\alpha_n</math>, where the <math>\alpha_i</math> are principal ordinals with <math>\alpha_1\geq\alpha_2\geq\cdots\geq\alpha_n</math>, and the <math>\alpha_i</math> are expressed in standard form

* If <math>\alpha</math> is an additively principal ordinal but not of the form <math>I(\beta,\gamma)</math>, then <math>\alpha</math> is expressible in the form <math>\psi_\pi(\delta)</math>. Then the standard form for <math>\alpha</math> is <math>\alpha=\psi_\pi(\delta)</math> where <math>\pi</math> and <math>\delta</math> are expressed in standard form

===Fundamental sequences===

The fundamental sequence for an ordinal number <math>\alpha</math> with cofinality <math>\text{cof}(\alpha)=\beta</math> is a strictly increasing sequence <math>(\alpha[\eta])_{\eta<\beta}</math> with length <math>\beta</math> and with limit <math>\alpha</math>, where <math>\alpha[\eta]</math> is the <math>\eta</math>-th element of this sequence.

Let <math>S=\{\alpha|\text{cof}(\alpha)=1\}</math> and <math>L=\{\alpha|\text{cof}(\alpha)\geq\omega\}</math> where <math>S</math> denotes the set of successor ordinals and <math>L</math> denotes the set of limit ordinals.

For non-zero ordinals <math>\alpha<\psi_{I(1,0,0)}(0)</math> written in standard form fundamental sequences are defined as follows:

* If <math>\alpha=\alpha_1+\alpha_2+\cdots+\alpha_n</math> with <math>n\geq 2</math> then <math>\text{cof}(\alpha)=\text{cof}(\alpha_n)</math> and <math>\alpha[\eta]=\alpha_1+\alpha_2+\cdots+(\alpha_n[\eta])</math>

* If <math>\alpha=\psi_{I(0,0)}(0)</math> then <math>\alpha=\text{cof}(\alpha)=1</math> and <math>\alpha[0]=0</math>

* If <math>\alpha=\psi_{I(0,\beta+1)}(0)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=I(0,\beta)\cdot\eta</math>

* If <math>\alpha=\psi_{I(0,\beta)}(\gamma+1)</math> and <math>\beta\in\{0\}\cup S</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=\psi_{I(0,\beta)}(\gamma)\cdot\eta</math>

* If <math>\alpha=\psi_{I(\beta+1,0)}(0)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=0</math> and <math>\alpha[\eta+1]=I(\beta,\alpha[\eta])</math>

* If <math>\alpha=\psi_{I(\beta+1,\gamma+1)}(0)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=I(\beta+1,\gamma)+1</math> and <math>\alpha[\eta+1]=I(\beta,\alpha[\eta])</math>

* If <math>\alpha=\psi_{I(\beta+1,\gamma)}(\delta+1)</math> and <math>\gamma\in\{0\}\cup S</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=\psi_{I(\beta+1,\gamma)}(\delta)+1</math> and <math>\alpha[\eta+1]=I(\beta,\alpha[\eta])</math>

* If <math>\alpha=\psi_{I(\beta,0)}(0)</math> and <math>\beta\in L</math> then <math>\text{cof}(\alpha)=\text{cof}(\beta)</math> and <math>\alpha[\eta]=I(\beta[\eta],0)</math>

* If <math>\alpha=\psi_{I(\beta,\gamma+1)}(0)</math> and <math>\beta\in L</math> then <math>\text{cof}(\alpha)=\text{cof}(\beta)</math> and <math>\alpha[\eta]=I(\beta[\eta],I(\beta,\gamma)+1)</math>

* If <math>\alpha=\psi_{I(\beta,\gamma)}(\delta+1)</math> and <math>\beta\in L</math> and <math>\gamma\in \{0\}\cup S</math> then <math>\text{cof}(\alpha)=\text{cof}(\beta)</math> and <math>\alpha[\eta]=I(\beta[\eta],\psi_{I(\beta,\gamma)}(\delta)+1)</math>

* If <math>\alpha=\pi</math> then <math>\text{cof}(\alpha)=\pi</math> and <math>\alpha[\eta]=\eta</math>

* If <math>\alpha=I(\beta,\gamma)</math> and <math>\gamma\in L</math> then <math>\text{cof}(\alpha)=\text{cof}(\gamma)</math> and <math>\alpha[\eta]=I(\beta,\gamma[\eta])</math>

* If <math>\alpha=\psi_\pi(\beta)</math> and <math>\omega\le\text{cof}(\beta)<\pi</math> then <math>\text{cof}(\alpha)=\text{cof}(\beta)</math> and <math>\alpha[\eta]=\psi_\pi(\beta[\eta])</math>

* If <math>\alpha=\psi_\pi(\beta)</math> and <math>\text{cof}(\beta)=\rho\geq\pi</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[\eta]=\psi_\pi(\beta[\gamma[\eta]])</math> with <math>\gamma[0]=1</math> and <math>\gamma[\eta+1]=\psi_{\rho}(\beta[\gamma[\eta]])</math>

Limit of this notation <math>\psi_{I(1,0,0)}(0)</math>. If <math>\alpha=\psi_{I(1,0,0)}(0)</math> then <math>\text{cof}(\alpha)=\omega</math> and <math>\alpha[0]=0</math> and <math>\alpha[\eta+1]=I(\alpha[\eta],0)</math>

==Section VII. The function collapsing weakly Mahlo cardinals==

===Definition===

An ordinal is weakly Mahlo if it's an uncountable regular cardinal, and regular cardinals in it (in another word, less than it) are stationary. Let <math>M_{0}=0</math>, <math>M_{\alpha +1}</math> be the next weakly Mahlo cardinal after <math>M_{\alpha }</math>, and <math>M_{\alpha }=\sup\{M_{\beta }|\beta <\alpha \}</math> for limit ordinal <math>\alpha</math>.

Then,

<math>C_{0}(\alpha ,\beta )=\beta \cup \{0\}</math>

<math>C_{n+1}(\alpha ,\beta )=\{\gamma +\delta |\gamma ,\delta \in C_{n}(\alpha ,\beta )\}</math>

<math>\cup \{M_{\gamma }|\gamma \in C_{n}(\alpha ,\beta )\}</math>

<math>\cup \{\chi _{\pi }(\gamma )|\pi ,\gamma \in C_{n}(\alpha ,\beta )\wedge \gamma <\alpha \wedge \pi {\text{ is weakly Mahlo}}\}</math>

<math>\cup \{\psi _{\pi }(\gamma )|\pi ,\gamma \in C_{n}(\alpha ,\beta )\wedge \gamma <\alpha \wedge \pi {\text{ is uncountable regular}}\}</math>

<math>C(\alpha ,\beta )=\bigcup _{n<\omega }C_{n}(\alpha ,\beta )</math>

<math>\chi _{\pi }(\alpha )=\min\{\beta <\pi |C(\alpha ,\beta )\cap \pi \subseteq \beta \wedge \beta {\text{ is uncountable regular}}\}</math>

<math>\psi _{\pi }(\alpha )=\min\{\beta <\pi |C(\alpha ,\beta )\cap \pi \subseteq \beta \}</math>

===Fundamental sequences for the function collapsing weakly Mahlo cardinals===

For the function collapsing weakly Mahlo cardinals fundamental sequences defined as follows:

* <math>C_{0}=\{0,1\}</math>

* <math>C_{n+1}=\{\alpha +\beta ,M_{\gamma },\chi _{\delta }(\epsilon ),\psi _{\zeta }(\eta )|\alpha ,\beta ,\gamma ,\delta ,\epsilon ,\zeta ,\eta \in C_{n}\wedge \delta \in W\wedge \zeta \in R\}</math>

* <math>L(\alpha )=\text{min}\{n<\omega |\alpha \in C_{n}\}</math>

* <math>\alpha [n]=\text{max}\{\beta <\alpha |L(\beta )\leq L(\alpha )+n\}</math>

where <math>R</math> denotes set of all uncountable regular cardinals and <math>W</math> denotes set of all weakly Mahlo cardinals.

==Section VIII. Fundamental sequences for the function collapsing <math>M(\alpha; \beta)</math>==

===Definition of <math>M(\alpha ;\beta )</math>===

If <math>\beta =0</math> or <math>\beta =\beta '+1</math> then <math>M(\alpha ;\beta )</math> is an <math>\alpha</math>-weakly Mahlo cardinal.

Let in this section <math>W(\alpha)</math> be the set of all <math>\alpha</math>-weakly Mahlo cardinals, <math>R</math> be the set of all uncountable regular cardinals less than <math>\text{min}\{\xi |\xi =M(\xi ;0)\}</math> and the variable <math>\pi</math> be reserved for uncountable regular cardinals of the forms <math>M(\alpha ;\beta +1)</math> or <math>M(\alpha ;0)</math>.

* If <math>\alpha =0</math> then <math>W(\alpha )=R</math>

* If <math>\alpha >0</math> then <math>W(\alpha )=\{\gamma \in R|\forall \delta <\alpha :W(\delta )\cap \gamma \text{ is stationary in }\gamma \}</math>

* If <math>\beta =0</math> then <math>M(\alpha ;\beta )=\text{min}W(\alpha )</math>

* If <math>\beta =\beta '+1</math> then <math>M(\alpha ;\beta )=\text{min}\{\gamma \in W(\alpha )|\gamma >M(\alpha ,\beta ')\}</math>

* If <math>\beta</math> is a limit ordinal then <math>M(\alpha ;\beta )=\sup\{M(\alpha ;\gamma )|\gamma <\beta \}</math>

===Definition of <math>\psi _{\pi }(\alpha)</math>===

<math>C_{0}(\alpha ,\beta )=\beta \cup \{0\}</math>

<math>C_{n+1}(\alpha ,\beta )=\{\gamma +\delta |\gamma ,\delta \in C_{n}(\alpha ,\beta )\}</math>

<math>\cup \{M(\gamma ;\delta )|\gamma ,\delta \in C_{n}(\alpha ,\beta )\}</math>

<math>\cup \{\chi _{\pi }^{\gamma }(\delta )|\pi ,\gamma ,\delta \in C_{n}(\alpha ,\beta )\wedge \delta <\alpha \}</math>

<math>\cup \{\psi _{\pi }(\gamma )|\pi ,\gamma \in C_{n}(\alpha ,\beta )\wedge \gamma <\alpha \}</math>

<math>C(\alpha ,\beta )=\bigcup _{n<\omega }C_{n}(\alpha ,\beta )</math>

<math>\chi _{\pi }^{\gamma }(\alpha )=\min(\{\beta <\pi |C(\alpha ,\beta )\cap \pi \subseteq \beta \wedge \beta \in W(\gamma )\}\cup \{\pi \})</math>

<math>\psi _{\pi }(\alpha )=\min(\{\beta <\pi |C(\alpha ,\beta )\cap \pi \subseteq \beta \}\cup \{\pi \})</math>

===Fundamental sequences===

The fundamental sequence for a countable limit ordinal <math>\alpha</math> is defined as follows:

<math>C_{0}=\{0\}</math>

<math>C_{n+1}=\{\gamma +\delta |\gamma ,\delta \in C_{n}\}</math>

<math>\cup \{M(\gamma ;\delta )|\gamma ,\delta \in C_{n}\}</math>

<math>\cup \{\chi _{\pi }^{\gamma }(\delta )|\pi ,\gamma ,\delta \in C_{n}\}</math>

<math>\cup \{\psi _{\pi }(\gamma )|\pi ,\gamma \in C_{n}\}</math>

<math>L(\alpha )=\text{min}\{n<\omega |\alpha \in C_{n}\}</math>

<math>\alpha [n]=\text{max}\{\beta <\alpha |L(\beta )\leq L(\alpha )+n\}</math>

==Section IX. My system of number names (FGS) ==

This is a naming system for numbers that are defined using the fast-growing hierarchy.

The numbers were grouped into several series also called fast-growing series or FGS. Aims of this system of naming for numbers:

1. number names must be connected with the fast-growing hierarchy,

2. number names must allow to easily restore mathematical expressions, which define those numbers.

Codes of operations (group 1)

{| border="1"

|codes

|operations

|-

|add

|Addition <math>+</math>

|-

|ult

|Multiplication <math>\times</math>

|-

|ex

|Exponentiation <math>\uparrow</math>

|-

|tetr

|Tetration <math>\uparrow^2</math>

|-

|pent

|Pentation <math>\uparrow^3</math>

|-

|hex

|Hexation <math>\uparrow^4</math>

|-

|hept

|Heptation <math>\uparrow^5</math>

|-

|}

and so on

Codes of some natural numbers (group 2)

{| border="1"

|codes

|natural numbers

|-

|zer(o)

|<math>0</math>

|-

|un(i)

|<math>1</math>

|-

|b(i)

|<math>2</math>

|-

|tr(i)

|<math>3</math>

|-

|quadr(i)

|<math>4</math>

|-

|quint(i)

|<math>5</math>

|-

|sext(i)

|<math>6</math>

|-

|sept(i)

|<math>7</math>

|-

|oct(i)

|<math>8</math>

|-

|non(i)

|<math>9</math>

|-

|dek(o)

|<math>10</math>

|-

|hekt(o)

|<math>10^2</math>

|-

|kil(o)

|<math>10^3</math>

|-

|meg(o)

|<math>10^6</math>

|-

|gig(o)

|<math>10^9</math>

|-

|ter(o)

|<math>10^{12}</math>

|-

|pet(o)

|<math>10^{15}</math>

|-

|ex(o)

|<math>10^{18}</math>

|-

|zett(o)

|<math>10^{21}</math>

|-

|yott(o)

|<math>10^{24}</math>

|-

|}

Note 1: do not write the letter in parentheses if this code is followed by any vowel letter

Note 2: codes of two-digit numbers from 11 to 99 can be obtained at the reading of those two-digit numbers from right to left by replacing the digits in them with codes of corresponding one-digit numbers (for example: trib(i) for 23)

Codes of ordinals and functions (group 3)

{| border="1"

|codes

|ordinals and functions

|-

|alum

|a finite ordinal

|-

|om

|the first transfinite ordinal <math>\omega</math>

|-

|ep

|ordinal <math>\varepsilon_0=\text{min}\{\alpha|\omega^\alpha=\alpha\}</math>

|-

|zet

|ordinal <math>\zeta_0=\text{min}\{\alpha|\varepsilon_\alpha=\alpha\}</math>

|-

|et

|ordinal <math>\eta_0=\text{min}\{\alpha|\zeta_\alpha=\alpha\}</math>

|-

|phi

|the Veblen function <math>\varphi</math> of two variables

|-

|gam

|ordinal <math>\Gamma_0=\text{min}\{\alpha|\varphi(\alpha,0)=\alpha\}</math>

|-

|omm

|the first uncountable ordinal <math>\Omega</math>

|-

|thet

|Feferman's theta-function <math>\theta</math>

|-

|wil

|the extended Wilfried Buchholz's function <math>\psi_0</math>

|-

|ot

|the first weakly inaccessible cardinal <math>I_1</math>

|-

|os

|the Hypcos's function <math>\psi_{\Omega_1}</math>

|-

|ah

|the function collapsing <math>\alpha</math>-weakly inaccessible cardinals <math>\psi_{I(0,0)}</math>

|-

|im

|the first 0-weakly inaccessible cardinal <math>I(0,0)</math>

|-

|em

|the first weakly Mahlo cardinal <math>M_1</math>

|-

|ar

|the function collapsing weakly Mahlo cardinals <math>\psi_{\alpha}</math> where <math>\alpha=\chi_{M_1}(0)</math>

|-

|am

|the first 0-weakly Mahlo cardinal <math>M(0;0)</math>

|-

|us

|the function collapsing <math>M(\alpha;\beta)</math> into countable ordinals <math>\psi_{M(0;0)}</math>

|-

|}

In general case use the following rules for generation of number names:

''' rule 1.'''

If a number <math>n</math> is defined using a function of the fast-growing hierarchy, then read ordinal index of the function from right to left using codes to get the name of the number <math>n</math> and in case if argument of the function is not equal to ten also write code of the argument in the beginning of the name, adding "argum-". Default argument is equal to ten.

Example 1. <math>f_{\omega^3+\omega.2+3}(10)</math> is traddbultomaddtrexom and <math>f_{\omega^\omega+3}(10)</math> is traddomexom.

Example 2. <math>f_{\omega+1}(10)</math> is unaddom, but <math>f_{\omega+1}(3)</math> is trargum-unaddom.

Thus, if name of a number <math>n</math> contains at least one code from group 3, then <math>n</math> is defined using a function of the fast-growing hierarchy where the ordinal index of the function at the reading from right to left corresponds to sequence of codes inside name of the number <math>n</math>.

''' rule 2.'''

If name of a number <math>n</math> does not contain codes from group 3, then <math>n=a\uparrow^b c</math> where <math>a\uparrow^b c</math> at the reading from right to left corresponds to sequence of codes from groups 1-2 inside name of the number <math>n</math>. Default <math>a=10</math>

For example: quadritetr is <math>10\uparrow^2 4</math>, quintipent is <math>10\uparrow^3 5</math>, nonihex is <math>10\uparrow^4 9</math>

''' Special operations '''

1) '''in'''-operation (code: in)

If name of a number <math>n</math> contains "in" between code of a natural number <math>b</math> and code of <math>\alpha</math>, then this case corresponds to repeating <math>b</math> times of insertion of <math>\alpha</math> inside ordinal index of function of the fast-growing hierarchy, which used for definition of the number <math>n</math>:

<math>\underbrace{\alpha(\alpha(...(\alpha(i))...))}_{b+1\quad \alpha 's}</math> where <math>i=\left\{\begin{array}{lcr} 0\text{ if }\alpha(0)>0\\ 1\text{ if }\alpha(0)=0\\ \end{array}\right.</math>

example 1. "Trinep" is equal to <math>f_{\varepsilon(\varepsilon(\varepsilon(\varepsilon(0))))}(10)=f_{\varepsilon_{\varepsilon_{\varepsilon_{\varepsilon_0}}}}(10)</math>

example 2. "Trinphi" is equal to <math>f_{\varphi(\varphi(\varphi(\varphi(0,0),0),0),0)}(10)</math>, where <math>\varphi(0,0)=\omega^0=1</math>

2) ''' mix '''-operation (code: mix)

If name of a number <math>n</math> contains "mix" between code of a natural number <math>b</math> and codes of <math>\alpha</math> and <math>\beta</math>, then this case corresponds to repeating <math>b</math> times of the alternation of <math>\alpha</math> and <math>\beta</math> inside ordinal index of function of the fast-growing hierarchy, which used for definition of the number <math>n</math>:

<math>\underbrace{\beta(\alpha(\beta(\alpha...(\beta(\alpha(1))...)))}_{b \quad\alpha's}</math>

example 1. Trimixommthet

<math>f_{\theta(\Omega(\theta(\Omega(\theta(\Omega(1))))))}(10)=</math>

<math>=f_{\theta(\Omega_{\theta(\Omega_{\theta(\Omega)})})}(10)</math>

example 2. trimixphithet

<math>f_{\theta(\varphi(\theta(\varphi(\theta(\varphi(1,0)),0)),0))}(10)</math>

''' Default'''

If name of a number <math>n</math> contains directly following one another codes of <math>\alpha</math> and <math>\beta</math> without "mix" before them, and code of <math>\beta</math> belongs to group 3, then this case corresponds to <math>\beta(\alpha)</math> inside ordinal index of function of the fast-growing hierarchy, which used for definition of the number <math>n</math>.

example 1. "triphi" is equal to <math>f_{\varphi(3,0)}(10)</math> where <math>\varphi</math> is the Veblen function of two variables

example 2. "ommthet" is equal to <math>f_{\theta(\Omega)}(10)</math>

example 3. "trommthet" is equal to <math>f_{\theta(\Omega(3))}(10)=f_{\theta(\Omega_3)}(10)</math>

example 4. "Trinommwil" is equal to <math>f_{\psi_0(\Omega(\Omega(\Omega(\Omega(0)))))}(10)=f_{\psi_0(\Omega(\Omega(\Omega(1))))}(10)=f_{\psi_0(\Omega_{\Omega_{\Omega}})}(10)</math> since for the extended Wilfried Buchholz's functions <math>\Omega_0=1</math> but "Trinommos" is equal to <math>f_{\psi_{\Omega_1}(\Omega(\Omega(\Omega(\Omega(1)))))}(10)=f_{\psi_{\Omega_1}(\Omega_{\Omega_{\Omega_{\Omega}}})}(10)</math> since for the Hypcos's functions <math>\Omega_0=0</math>

Note: zeromm is <math>\Omega(0)=\Omega_0</math>, omm=unomm is <math>\Omega(1)=\Omega_1=\Omega</math> - first uncountable ordinal (i.e. the smallest ordinal that has cardinality <math>\aleph_1</math>), bomm is <math>\Omega(2)=\Omega_2</math> - the smallest ordinal that has cardinality <math>\aleph_2</math>, tromm is <math>\Omega(3)=\Omega_3</math> and so on; ep is <math>\varepsilon_0</math> and gamm is <math>\Gamma_0</math> but unep is <math>\varepsilon_1</math> and unigam is <math>\Gamma_1</math> and so on.

if code of number is not written before code of operation, then number is 10 default

addom is <math>f_{\omega+10}(10)</math>=dekaddom

ultom is <math>f_{\omega.10}(10)</math>=dekultom

exom is <math>f_{\omega^{10}}(10)</math>=dekexom

tetrom is <math>f_{\omega\uparrow^2 10}(10)</math>=dekotetrom

inphi is <math>f_{\underbrace{\varphi(\varphi(...(\varphi(0,0),0)...),0)}_{11 \quad \varphi's}}(10)</math>=dekinphi

mixommthet is <math>f_{\underbrace{\theta(\Omega_{\theta(\Omega_{..._{\theta(\Omega)}})})}_{10 \Omega 's}}(10)</math>= dekomixommthet

inommthet is <math>f_{\underbrace{\theta(\Omega_{\Omega_{..._{\Omega}}})}_{10 \quad\Omega 's}}(10)</math>=dekinommthet

addultexom is <math>f_{\omega^{10}.10+10}(10)</math>

''' Appendix 1: huge units of measurement'''

l-<math>\bullet</math> is the distance <math>\bullet</math> meters,

c-<math>\bullet</math> is the <math>\bullet</math>-dimensional hypercube with side length <math>\bullet</math> meters,

t-<math>\bullet</math> is the time interval <math>\bullet</math> seconds,

m-<math>\bullet</math> is the mass <math>\bullet</math> kg.

Example: l-inommthet = inommthet meters.

''' Appendix 2: googological regions '''

Let's define: Ra<math>\bullet</math> is spherical region of the universe bounded by imaginary sphere with center at the Earth's center and with radius of <math>\bullet</math> meters, where <math>\bullet</math> is a name of number, which was created according this system of names (if name of number begins with a vowel then don't write "a" in "Ra").

Note 1: this definition is made on the assumption that our universe is infinite.

Note 2: a sphere with center <math>c</math> and with radius <math>r</math> is the set of all points that are at distance <math>r</math> from <math>c</math>.

Example 1: Roctinommwil is spherical region of the universe bounded by imaginary sphere with center at the Earth's center and with radius of octinommwil meters. Octinommwil is equal to <math>f_{\psi_{0}(\alpha[8])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the extended Wilfried Buchholz's functions, where <math>\alpha[0]=1</math> and <math>\alpha[n+1]=\Omega_{\alpha[n]}</math> for all integers <math>n\geq0</math>

Example 2. Ratrimah is spherical region of the universe bounded by imaginary sphere with center at the Earth's center and with radius of trimah meters. Trimah is equal to <math>f_{\psi_{I(0,0)}(I(3,0))}(10)</math> using the fast-growing hierarchy with fundamental sequences for the functions collapsing <math>\alpha</math>-weakly inaccessible cardinals.

Example 3. Ratrinimah is spherical region of the universe bounded by imaginary sphere with center at the Earth's center and with radius of trinimah meters. Trinimah is equal to <math>f_{\psi_{I(0,0)}(I(I(I(I(0,0),0),0),0))}(10)</math> using the fast-growing hierarchy with fundamental sequences for the functions collapsing <math>\alpha</math>-weakly inaccessible cardinals.

Example 4. Roctinemar is spherical region of the universe bounded by imaginary sphere with center at the Earth's center and with radius of octinemar meters. Octinemar is equal to <math>f_{\psi _{\alpha }(\beta [9])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the function collapsing weakly Mahlo cardinals, where <math> \alpha =\chi _{M_{1}}(0)</math> and <math> \beta [0]=1</math> and <math> \beta [n+1]=M_{\beta [n]}</math> for all integers <math>n\geq 0</math>

Another examples: Runaddom, Runaddep, Runingam, Ratrinotos, Roctinamus, Ratarintar.

About unaddom, unaddep, uningam, trinotos, octinamus, tarintar you can read below.

==Section X. List of my numbers==

All that you can see below is a list of my numbers defined using the fast-growing hierarchy.

===1) Series with finite ordinals ===

''' Series 1.1 ''' (Alpha series)

Names of all numbers of series 1.1 contain code: alum.

See also the fast-growing hierarchy.

Zeralum <math>f_0(10)=10+1=11</math>

Unalum <math>f_1(10)=f_0^{10} (10)= f_0(f_0 (f_0(f_0(f_0( f_0( f_0( f_0( f_0( f_0( 10))))))))))=20</math>

Balum <math>f_2(10)=f_1^{10} (10)= f_1(f_1 (f_1(f_1(f_1( f_1( f_1( f_1( f_1( f_1( 10))))))))))=2^{10}\times 10=10240</math>

Tralum <math>f_3(10)=f_2^{10} (10)= f_2(f_2(f_2(f_2(f_2(f_2(f_2(f_2(f_2(f_2(10))))))))))\approx</math>

<math>\approx 10^{10^{10^{10^{10^{10^{10^{10^{1,0865890600\times 10^{3086}}}}}}}}}</math>

Quadralum <math>f_4(10)=f_3^{10}(10)</math>

Quintalum <math>f_5(10)=f_4^{10}(10)</math>

Sextalum <math>f_6(10)=f_5^{10}(10)</math>

Septalum <math>f_7(10)=f_6^{10}(10)</math>

Octalum <math>f_8(10)=f_7^{10}(10)</math>

Nonalum <math>f_9(10)=f_8^{10}(10)</math>

Dekalum <math>f_{10} (10)=f_9^{10}(10)</math>

Hektalum <math>f_{100} (10)</math>

Kilalum <math>f_{1000} (10)</math>

Megalum <math>f_{10^{6}} (10)</math>

Gigalum <math>f_{10^{9}} (10)</math>

Teralum <math>f_{10^{12}} (10)</math>

Petalum <math>f_{10^{15}} (10)</math>

Exalum <math>f_{10^{18}} (10)</math>

Zettalum <math>f_{10^{21}} (10)</math>

Yottalum <math>f_{10^{24}}(10)</math>

Full list of the names of the numbers in this series, see here: <nowiki>https://sites.google.com/site/travelingtotheinfinity/my-system-of-number-names/generator-of-googologisms/before-w</nowiki>

===2) Omega series ===

These four series 2.1-2.4 consist of my numbers defined using the fast-growing hierarchy with fundamental sequences for limit ordinals written in Cantor normal form.

'''Series 2.1 ''' (Omega-addition series)

Names of all numbers of series 2.1 contain following codes: add, om.

Zeraddom <math>f_{\omega} (10)=f_{10} (10)</math>

Unaddom <math>f_{\omega+1} (10)=f_{\omega } ^{10} (10)</math>

Baddom <math>f_{\omega+2 }(10) = f_{\omega+1}^{10} (10)</math>

Traddom <math>f_{\omega+3 } (10)</math>

Quadraddom <math>f_{\omega+4 } (10)</math>

Quintaddom <math>f_{\omega+5 } (10)</math>

Sextaddom <math>f_{\omega+6 } (10)</math>

Septaddom <math>f_{\omega+7 } (10)</math>

Octaddom <math>f_{\omega+8 } (10)</math>

Nonaddom <math>f_{\omega+9 } (10)</math>

Dekaddom <math>f_{\omega+10 } (10)</math>

Hektaddom <math>f_{\omega+100 } (10)</math>

Kiladdom <math>f_{\omega+10^{3} } (10)</math>

Megaddom <math>f_{\omega+10^{6} } (10)</math>

Gigaddom <math>f_{\omega+10^{9} } (10)</math>

Teraddom <math>f_{\omega+10^{12} } (10)</math>

Petaddom <math>f_{\omega+10^{15} } (10)</math>

Exaddom <math>f_{\omega+10^{18} } (10)</math>

Zettaddom <math>f_{\omega+10^{21} } (10)</math>

Yottaddom <math>f_{\omega+10^{24} } (10)</math>

'''Series 2.2 ''' (Omega- multiplication series)

Names of all numbers of series 2.2 contain following codes: ult, om.

Bultom <math>f_{\omega.2 } (10)= f_{\omega+10} (10)</math>

Trultom <math>f_{\omega.3 } (10)= f_{\omega.2+10} (10)</math>

Quadrultom <math>f_{\omega.4 } (10)= f_{\omega.3+10} (10)</math>

Quintultom <math>f_{\omega.5 } (10)= f_{\omega.4+10} (10)</math>

Sextultom <math>f_{\omega.6 } (10)</math>

Septultom <math>f_{\omega.7 } (10)</math>

Octultom <math>f_{\omega.8 } (10)</math>

Nonultom <math>f_{\omega.9 } (10)</math>

Dekultom <math>f_{\omega.10 } (10)</math>

Hektultom <math>f_{\omega.100 } (10)</math>

Kilultom <math>f_{\omega.1000 } (10)</math>

Megultom <math>f_{\omega.10^{6} } (10)</math>

Gigultom <math>f_{\omega.10^{9} } (10)</math>

Terultom <math>f_{\omega.10^{12} } (10)</math>

Petultom <math>f_{\omega.10^{15} } (10)</math>

Exultom <math>f_{\omega.10^{18} } (10)</math>

Zettultom <math>f_{\omega.10^{21} } (10)</math>

Yottultom <math>f_{\omega.10^{24} } (10)</math>

''' Series 2.3 ''' (Omega- exponentiation series)

Names of all numbers of series 2.3 contain following codes: ex, om.

Bexom <math>f_{\omega^2} (10)=f_{\omega.10 } (10)</math>

Trexom <math>f_{\omega^{3}} (10)</math>

Quadrexom <math>f_{\omega^{4}} (10)</math>

Quintexom <math>f_{\omega^{5}} (10)</math>

Sextexom <math>f_{\omega^{6}} (10)</math>

Septexom <math>f_{\omega^{7}} (10)</math>

Octexom <math>f_{\omega^{8}} (10)</math>

Nonexom <math>f_{\omega^{9}} (10)</math>

Dekexom <math>f_{\omega^{10}} (10)</math>

Hektexom <math>f_{\omega^{100}} (10)</math>

Kilexom <math>f_{\omega^{10^{3}}} (10)</math>

Megexom <math>f_{\omega^{10^{6}}} (10)</math>

Gigexom <math>f_{\omega^{10^{9}}} (10)</math>

Terexom <math>f_{\omega^{10^{12}}} (10)</math>

Petexom <math>f_{\omega^{10^{15}}} (10)</math>

Exexom <math>f_{\omega^{10^{18}}} (10)</math>

Zettexom <math>f_{\omega^{10^{21}}} (10)</math>

Yottexom <math>f_{\omega^{10^{24}}} (10)</math>

''' Series 2.4 ''' (Omega- tetration series)

Names of all numbers of series 2.4 contain following codes: tetr, om.

Bitetrom <math>f_{\omega\uparrow\uparrow 2 } (10)= f_{\omega^{\omega }} (10)=f_{\omega^{10}} (10)</math>

Tritetrom <math>f_{\omega\uparrow\uparrow 3 } (10)= f_{\omega^{\omega^{\omega }}} (10)</math>

Quadritetrom <math>f_{\omega\uparrow\uparrow 4 } (10)</math>

Quintitetrom <math>f_{\omega\uparrow\uparrow 5 } (10)</math>

Sextitetrom <math>f_{\omega\uparrow\uparrow 6 } (10)</math>

Septitetrom <math>f_{\omega\uparrow\uparrow 7 } (10)</math>

Octitetrom <math>f_{\omega\uparrow\uparrow 8 } (10)</math>

Nonitetrom <math>f_{\omega\uparrow\uparrow 9 } (10)</math>

Dekotetrom <math>f_{\omega\uparrow\uparrow 10 } (10)</math>

Hektotetrom <math>f_{\omega\uparrow\uparrow 100 } (10)</math>

Kilotetrom <math>f_{\omega\uparrow\uparrow 1000 } (10)</math>

Megotetrom <math>f_{\omega\uparrow\uparrow 10^{6} } (10)</math>

Gigotetrom <math>f_{\omega\uparrow\uparrow 10^{9} } (10)</math>

Terotetrom <math>f_{\omega\uparrow\uparrow 10^{12} } (10)</math>

Petotetrom <math>f_{\omega\uparrow\uparrow 10^{15} } (10)</math>

Exotetrom <math>f_{\omega\uparrow\uparrow 10^{18} } (10)</math>

Zettotetrom <math>f_{\omega\uparrow\uparrow 10^{21} } (10)</math>

Yottotetrom <math>f_{\omega\uparrow\uparrow 10^{24} } (10)</math>

===3) Epsilon series ===

''' 3.1) Epsilon(0) series '''

''' Series 3.1.1 ''' (Epsilon(0)-addition series)

In series 3.1.1 <math>f_{\varepsilon(0)+n}(10)=f_{\varphi(1,0)+n}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>n</math> is a non-negative integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 3.1.1 contain following codes: add, ep.

Zeraddep <math>f_{\varepsilon(0)} (10)</math>

Unaddep <math>f_{\varepsilon(0)+1} (10)</math>

Baddep <math>f_{\varepsilon(0)+2 }(10)</math>

Traddep <math>f_{\varepsilon(0)+3 } (10)</math>

Quadraddep <math>f_{\varepsilon(0)+4 } (10)</math>

Quintaddep <math>f_{\varepsilon(0)+5 } (10)</math>

Sextaddep <math>f_{\varepsilon(0)+6 } (10)</math>

Septaddep <math>f_{\varepsilon(0)+7 } (10)</math>

Octaddep <math>f_{\varepsilon(0)+8 } (10)</math>

Nonaddep <math>f_{\varepsilon(0)+9 } (10)</math>

Dekaddep <math>f_{\varepsilon(0)+10 } (10)</math>

Hektaddep <math>f_{\varepsilon(0)+100 } (10)</math>

Kiladdep <math>f_{\varepsilon(0)+10^{3} } (10)</math>

Megaddep <math>f_{\varepsilon(0)+10^{6} } (10)</math>

Gigaddep <math>f_{\varepsilon(0)+10^{9} } (10)</math>

Teraddep <math>f_{\varepsilon(0)+10^{12} } (10)</math>

Petaddep <math>f_{\varepsilon(0)+10^{15} } (10)</math>

Exaddep <math>f_{\varepsilon(0)+10^{18} } (10)</math>

Zettaddep <math>f_{\varepsilon(0)+10^{21} } (10)</math>

Yottaddep <math>f_{\varepsilon(0)+10^{24} } (10)</math>

''' Series 3.1.2 ''' (Epsilon(0)-multiplication series)

In series 3.1.2 <math>f_{\varepsilon(0).k}(10)=f_{\varphi(1,0)\cdot k}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k</math> is a positive integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 3.1.2 contain following codes: ult, ep.

Bultep <math>f_{\varepsilon(0).2 } (10)</math>

Trultep <math>f_{\varepsilon(0).3 } (10)</math>

Quadrultep <math>f_{\varepsilon(0).4 } (10)</math>

Quintultep <math>f_{\varepsilon(0).5 } (10)</math>

Sextultep <math>f_{\varepsilon(0).6 } (10)</math>

Septultep <math>f_{\varepsilon(0).7 } (10)</math>

Octultep <math>f_{\varepsilon(0).8 } (10)</math>

Nonultep <math>f_{\varepsilon(0).9 } (10)</math>

Dekultep <math>f_{\varepsilon(0).10 } (10)</math>

Hektultep <math>f_{\varepsilon(0).100 } (10)</math>

Kilultep <math>f_{\varepsilon(0).1000 } (10)</math>

Megultep <math>f_{\varepsilon(0).10^{6} } (10)</math>

Gigultep <math>f_{\varepsilon(0).10^{9} } (10)</math>

Terultep <math>f_{\varepsilon(0).10^{12} } (10)</math>

Petultep <math>f_{\varepsilon(0).10^{15} } (10)</math>

Exultep <math>f_{\varepsilon(0).10^{18} } (10)</math>

Zettultep <math>f_{\varepsilon(0).10^{21} } (10)</math>

Yottultep <math>f_{\varepsilon(0).10^{24} } (10)</math>

''' Series 3.1.3 ''' (Epsilon(0)-exponentiation series)

In series 3.1.3 <math>f_{\varepsilon(0)^k}(10)=f_{\varphi(0,\varphi(1,0)\cdot k)}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k>1</math> is an integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 3.1.3 contain following codes: ex, ep.

Bexep <math>f_{\varepsilon(0)^2}(10)</math>

Trexep <math>f_{\varepsilon(0)^{3}} (10)</math>

Quadrexep <math>f_{\varepsilon(0)^{4}} (10)</math>

Quintexep <math>f_{\varepsilon(0)^{5}} (10)</math>

Sextexep <math>f_{\varepsilon(0)^{6}} (10)</math>

Septexep <math>f_{\varepsilon(0)^{7}} (10)</math>

Octexep <math>f_{\varepsilon(0)^{8}} (10)</math>

Nonexep <math>f_{\varepsilon(0)^{9}} (10)</math>

Dekexep <math>f_{\varepsilon(0)^{10}} (10)</math>

Hektexep <math>f_{\varepsilon(0)^{100}} (10)</math>

Kilexep <math>f_{\varepsilon(0)^{10^{3}}} (10)</math>

Megexep <math>f_{\varepsilon(0)^{10^{6}}} (10)</math>

Gigexep <math>f_{\varepsilon(0)^{10^{9}}} (10)</math>

Terexep <math>f_{\varepsilon(0)^{10^{12}}} (10)</math>

Petexep <math>f_{\varepsilon(0)^{10^{15}}} (10)</math>

Exexep <math>f_{\varepsilon(0)^{10^{18}}} (10)</math>

Zettexep <math>f_{\varepsilon(0)^{10^{21}}} (10)</math>

Yottexep <math>f_{\varepsilon(0)^{10^{24}}} (10)</math>

''' Series 3.1.4 ''' (Epsilon(0)-tetration series)

In series 3.1.4 <math>f_{\varepsilon(0)\uparrow\uparrow k}(10)=f_{\alpha[k]}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k>1</math> is an integer

* <math>\alpha[0]=\varphi(1,0)+\varphi(1,0)</math> and <math>\alpha[n+1]=\varphi(0,\alpha[n])</math> where <math>n\geq0</math> is an integer and <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 3.1.4 contain following codes: tetr, ep.

Bitetrep <math>f_{\varepsilon(0)\uparrow\uparrow 2 } (10)</math>

Tritetrep <math>f_{\varepsilon(0)\uparrow\uparrow 3 } (10)</math>

Quadritetrep <math>f_{\varepsilon(0)\uparrow\uparrow 4 } (10)</math>

Quintitetrep <math>f_{\varepsilon(0)\uparrow\uparrow 5 } (10)</math>

Sextitetrep <math>f_{\varepsilon(0)\uparrow\uparrow 6 } (10)</math>

Septitetrep <math>f_{\varepsilon(0)\uparrow\uparrow 7 } (10)</math>

Octitetrep <math>f_{\varepsilon(0)\uparrow\uparrow 8 } (10)</math>

Nonitetrep <math>f_{\varepsilon(0)\uparrow\uparrow 9 } (10)</math>

Dekotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10 } (10)</math>

Hektotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 100 } (10)</math>

Kilotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 1000 } (10)</math>

Megotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{6} } (10)</math>

Gigotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{9} } (10)</math>

Terotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{12} } (10)</math>

Petotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{15} } (10)</math>

Exotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{18} } (10)</math>

Zettotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{21} } (10)</math>

Yottotetrep <math>f_{\varepsilon(0)\uparrow\uparrow 10^{24} } (10)</math>

3.2) Epsilon(1) series

'''Series 3.2.1 ''' (Epsilon(1)-addition series)

In series 3.2.1 <math>f_{\varepsilon(1)+n}(10)=f_{\varphi(1,1)+n}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>n</math> is a non-negative integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 3.2.1 contain following codes: add, un, ep.

Unaddunep <math>f_{\varepsilon(1)+1} (10)</math>

Baddunep <math>f_{\varepsilon(1)+2 }(10)</math>

Traddunep <math>f_{\varepsilon(1)+3 } (10)</math>

Quadraddunep <math>f_{\varepsilon(1)+4 } (10)</math>

Quintaddunep <math>f_{\varepsilon(1)+5 } (10)</math>

Sextaddunep <math>f_{\varepsilon(1)+6 } (10)</math>

Septaddunep <math>f_{\varepsilon(1)+7 } (10)</math>

Octaddunep <math>f_{\varepsilon(1)+8 } (10)</math>

Nonaddep <math>f_{\varepsilon(1)+9 } (10)</math>

Dekaddunep <math>f_{\varepsilon(1)+10 } (10)</math>

Hektaddunep <math>f_{\varepsilon(1)+100 } (10)</math>

Kiladdunep <math>f_{\varepsilon(1)+10^{3} } (10)</math>

Megaddunep <math>f_{\varepsilon(1)+10^{6} } (10)</math>

Gigaddunep <math>f_{\varepsilon(1)+10^{9} } (10)</math>

Teraddunep <math>f_{\varepsilon(1)+10^{12} } (10)</math>

Petaddunep <math>f_{\varepsilon(1)+10^{15} } (10)</math>

Exaddunep <math>f_{\varepsilon(1)+10^{18} } (10)</math>

Zettaddunep <math>f_{\varepsilon(1)+10^{21} } (10)</math>

Yottaddunep <math>f_{\varepsilon(1)+10^{24} } (10)</math>

''' Series 3.3 ''' (Inserted epsilon series)

In series 3.3 <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{k\quad\varepsilon's}} (10)=f_{\varphi(2,0)[k]}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k</math> is a positive integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 3.3 contain following codes: in, ep.

Uninep <math>f_{\varepsilon_{\varepsilon_{0}}} (10)</math>

Binep <math>f_{\varepsilon_{\varepsilon_{\varepsilon_{0}}}} (10)</math>

Trinep <math>f_{\varepsilon_{\varepsilon_{\varepsilon_{\varepsilon_{0}}}}} (10)</math>

Quadrinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{5\quad\varepsilon's}} (10)</math>

Quintinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{6\quad\varepsilon's}} (10)</math>

Sextinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{7\quad\varepsilon's}} (10)</math>

Septinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{8\quad\varepsilon's}} (10)</math>

Octinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{9\quad\varepsilon's}} (10)</math>

Noninep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10\quad\varepsilon's}} (10)</math>

Dekinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{11\quad\varepsilon's}} (10)</math>

Hektinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{101\varepsilon's}} (10)</math>

Kilinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{3}+1\varepsilon's}} (10)</math>

Meginep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{6}+1\varepsilon's}} (10)</math>

Giginep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{9}+1\varepsilon's}} (10)</math>

Terinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{12}+1\varepsilon's}} (10)</math>

Petinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{15}+1\varepsilon's}} (10)</math>

Exinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{18}+1\varepsilon's}} (10)</math>

Zettinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{21}+1\varepsilon's}} (10)</math>

Yottinep <math>f_{\underbrace{\varepsilon_{\varepsilon_{\cdots_{\varepsilon_{\varepsilon_{0}}}}}}_{10^{24}+1\varepsilon's}} (10)</math>

===4) Zeta series ===

''' Series 4.1''' (Inserted zeta series)

In series 4.1 <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{k\quad\zeta's}} (10)=f_{\varphi(3,0)[k]}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k</math> is a positive integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 4.1 contain following codes: in, zet.

Uninzet <math>f_{\zeta _{\zeta_{0}}} (10)</math>

Binzet <math>f_{\zeta_{\zeta_{\zeta_{0}}}} (10)</math>

Trinzet <math>f_{\zeta_{\zeta_{\zeta_{\zeta_{0}}}}} (10)</math>

Quadrinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{5\quad\zeta's}} (10)</math>

Quintinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{6\quad\zeta's}} (10)</math>

Sextinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{7\quad\zeta's}} (10)</math>

Septinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{8\quad\zeta's}} (10)</math>

Octinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{9\quad\zeta's}} (10)</math>

Noninzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10\quad\zeta's}} (10)</math>

Dekinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{11\quad\zeta's}} (10)</math>

Hektinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{101\zeta's}} (10)</math>

Kilinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{3}+1\zeta's}} (10)</math>

Meginzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{6}+1\zeta's}} (10)</math>

Giginzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{9}+1\zeta's}} (10)</math>

Terinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{12}+1\zeta's}} (10)</math>

Petinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{15}+1\zeta's}} (10)</math>

Exinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{18}+1\zeta's}} (10)</math>

Zettinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{21}+1\zeta's}} (10)</math>

Yottinzet <math>f_{\underbrace{\zeta_{\zeta_{\cdots_{\zeta_{\zeta_{0}}}}}}_{10^{24}+1\zeta's}} (10)</math>

===5) Eta series ===

''' Series 5.1 ''' (Inserted eta series)

In series 5.1 <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{k\quad\eta's}} (10)=f_{\varphi(4,0)[k]}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k</math> is a positive integer

* <math>\varphi</math> is the Veblen function of two variables.

Names of all numbers of series 5.1 contain following codes: in, et.

Uninet <math>f_{\eta _{\eta_{0}}} (10)</math>

Binet <math>f_{\eta_{\eta_{\eta_{0}}}} (10)</math>

Trinet <math>f_{\eta_{\eta_{\eta_{\eta_{0}}}}} (10)</math>

Quadrinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{5\quad\eta's}} (10)</math>

Quintinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{6\quad\eta's}} (10)</math>

Sextinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{7\quad\eta's}} (10)</math>

Septinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{8\quad\eta's}} (10)</math>

Octinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{9\quad\eta's}} (10)</math>

Noninet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10\quad\eta's}} (10)</math>

Dekinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{11\quad\eta's}} (10)</math>

Hektinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{101\eta's}} (10)</math>

Kilinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{3}+1\eta's}} (10)</math>

Meginet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{6}+1\eta's}} (10)</math>

Giginet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{9}+1\eta's}} (10)</math>

Terinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{12}+1\eta's}} (10)</math>

Petinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{15}+1\eta's}} (10)</math>

Exinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{18}+1\eta's}} (10)</math>

Zettinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{21}+1\eta's}} (10)</math>

Yottinet <math>f_{\underbrace{\eta_{\eta_{\cdots_{\eta_{\eta_{0}}}}}}_{10^{24}+1\eta's}} (10)</math>

===6) Phi-series ===

For series 6.1 and 6.2 the Veblen function <math>\varphi</math> of two variables is used. These two series consist of my numbers defined using the fast-growing hierarchy with fundamental sequences for the Veblen function.

''' Series 6.1'''

Names of all numbers of series 6.1 contain code: phi.

Uniphi <math>f_{\varphi(1,0)}(10)=f_{\varepsilon_0}(10)</math>

Biphi <math>f_{\varphi(2,0)}(10)=f_{\zeta_0}(10)</math>

Triphi <math>f_{\varphi(3,0)}(10)=f_{\eta_0}(10)</math>

Quadriphi <math>f_{\varphi(4,0)}(10)</math>

Quintiphi <math>f_{\varphi(5,0)}(10)</math>

Sextiphi <math>f_{\varphi(6,0)}(10)</math>

Septiphi <math>f_{\varphi(7,0)}(10)</math>

Octiphi <math>f_{\varphi(8,0)}(10)</math>

Noniphi <math>f_{\varphi(9,0)}(10)</math>

Dekophi <math>f_{\varphi(10,0)}(10)</math>

Hektophi <math>f_{\varphi(100,0)}(10)</math>

Kilophi <math>f_{\varphi(1000,0)}(10)</math>

Megophi <math>f_{\varphi(10^{6},0)}(10)</math>

Gigophi <math>f_{\varphi(10^{9},0)}(10)</math>

Terophip <math>f_{\varphi(10^{12},0)}(10)</math>

Petophi <math>f_{\varphi(10^{15},0)}(10)</math>

Exophi <math>f_{\varphi(10^{18},0)}(10)</math>

Zettophi <math>f_{\varphi(10^{21},0)}(10)</math>

Yottophi <math>f_{\varphi(10^{24},0)}(10)</math>

''' Series 6.2''' (Inserted phi series)

Names of all numbers of series 6.2 contain following codes: in, phi.

Uninphi <math>f_{\varphi(\varphi(0,0),0)} (10)</math>

Binphi <math>f_{\varphi(\varphi(\varphi(0,0),0),0)} (10)</math>

Trinphi <math>f_{\varphi(\varphi(\varphi(\varphi(0,0),0),0),0)} (10)</math>

Quadrinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{5 \quad \varphi's}} (10)</math>

Quintinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{6 \quad \varphi's}} (10)</math>

Sextinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0),0)...,0)}_{7 \quad \varphi's}} (10)</math>

Septinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{8 \quad \varphi's}} (10)</math>

Octinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{9 \quad \varphi's}} (10)</math>

Noninphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0),...0),0)}_{10 \quad \varphi's}} (10)</math>

Dekinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{11 \quad \varphi's}} (10)</math>

Hektinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{101 \quad \varphi's}} (10)</math>

Kilinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{3}+1 \quad \varphi's}} (10)</math>

Meginphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{6}+1 \quad \varphi's}} (10)</math>

Giginphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{9}+1 \quad \varphi's}} (10)</math>

Terinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{12}+1 \quad \varphi's}} (10)</math>

Petinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{15}+1 \quad \varphi's}} (10)</math>

Exinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{18}+1 \quad \varphi's}} (10)</math>

Zettinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{21}+1 \quad \varphi's}} (10)</math>

Yottinphi <math>f_{\underbrace{\varphi(\varphi(\cdots\varphi(\varphi(0,0),0)...,0),0)}_{10^{24}+1 \quad \varphi's}} (10)</math>

===7) Gamma series===

''' Series 7.1''' (Inserted gamma series)

In series 7.1 <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{k\quad\Gamma's}} (10)=f_{\varphi(1,1,0)[k]}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k</math> is a positive integer

* <math>\varphi</math> is the Veblen function of three variables.

Names of all numbers of series 7.1 contain following codes: in, gam.

Uningam <math>f_{\Gamma _{\Gamma_{0}}} (10)</math>

Bingam <math>f_{\Gamma_{\Gamma_{\Gamma_{0}}}} (10)</math>

Tringam <math>f_{\Gamma_{\Gamma_{\Gamma_{\Gamma_{0}}}}} (10)</math>

Quadringam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{5\quad\Gamma's}} (10)</math>

Quintingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{6\quad\Gamma's}} (10)</math>

Sextingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{7\quad\Gamma's}} (10)</math>

Septingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{8\quad\Gamma's}} (10)</math>

Octingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{9\quad\Gamma's}} (10)</math>

Noningam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10\quad\Gamma's}} (10)</math>

Dekingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{11\quad\Gamma's}} (10)</math>

Hektingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{101\Gamma's}} (10)</math>

Kilingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{3}+1\Gamma's}} (10)</math>

Megingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{6}+1\Gamma's}} (10)</math>

Gigingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{9}+1\Gamma's}} (10)</math>

Teringam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{12}+1\Gamma's}} (10)</math>

Petingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{15}+1\Gamma's}} (10)</math>

Exingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{18}+1\Gamma's}} (10)</math>

Zettingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{21}+1\Gamma's}} (10)</math>

Yottingam <math>f_{\underbrace{\Gamma_{\Gamma_{\cdots_{\Gamma_{\Gamma_{0}}}}}}_{10^{24}+1\Gamma's}} (10)</math>

===8) Theta-series ===

In these series 8.1-8.3: <math>\theta(\alpha)=\theta_{\alpha}(0)</math> where <math>\theta_{\alpha}</math> is a Feferman's theta-function.

''' Series 8.1 ''' (Theta- exponentiation series)

In series 8.1 <math>f_{\theta (\Omega ^{k})}(10)=f_{\varphi (1,\underbrace {0,0,...,0} _{k+1\;\,0's})}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Veblen function, where:

* <math>k</math> is a positive integer

* <math>\varphi</math> is the Veblen function of <math>k+2</math> variables.

Names of all numbers of series 8.1 contain following codes: ex, omm, thet.

Unexommthet <math>f_{\theta(\Omega)}(10)=f_{\varphi(1,0,0)}(10)=</math>

<math>=f_{\Gamma_0}(10)=f_{\varphi(\varphi(\varphi\cdots(\varphi(1,0),0)\cdots),0)}(10)</math>

Bexommthet <math>f_{\theta(\Omega^2)}(10)=f_{\varphi(1,0,0,0)}(10)=</math>

<math>=f_{\varphi(\varphi(\varphi\cdots(\varphi(1,0,0),0,0)\cdots),0,0)}(10)</math>

Trexommthet <math>f_{\theta(\Omega^{3})}(10)=f_{\varphi(1,0,0,0,0)}(10)</math>

Quadrexommthet <math>f_{\theta(\Omega^{4})}(10)</math>

Quintexommthet <math>f_{\theta(\Omega^{5})}(10)</math>

Sextexommthet <math>f_{\theta(\Omega^{6})}(10)</math>

Septexommthet <math>f_{\theta(\Omega^{7})}(10)</math>

Octexommthet <math>f_{\theta(\Omega^{8})}(10)</math>

Nonexommthet <math>f_{\theta(\Omega^{9})}(10)</math>

Dekexommthet <math>f_{\theta(\Omega^{10})}(10)</math>

Small Veblen ordinal level

Hektexommthet <math>f_{\theta(\Omega^{100})}(10)</math>

Kilexommthet <math>f_{\theta(\Omega^{10^{3}})}(10)</math>

Megexommthet <math>f_{\theta(\Omega^{10^{6}})}(10)</math>

Gigexommthet <math>f_{\theta(\Omega^{10^{9}})}(10)</math>

Terexommthet <math>f_{\theta(\Omega^{10^{12}})}(10)</math>

Petexommthet <math>f_{\theta(\Omega^{10^{15}})}(10)</math>

Exexommthet <math>f_{\theta(\Omega^{10^{18}})}(10)</math>

Zettexommthet <math>f_{\theta(\Omega^{10^{21}})}(10)</math>

Yottexommthet <math>f_{\theta(\Omega^{10^{24}})}(10)</math>

''' Series 8.2 ''' (Theta- tetration series)

In series 8.2 <math>f_{\theta (\Omega \uparrow \uparrow k)}(10)=f_{\psi _{0}(\Omega \uparrow \uparrow (k+1))}(10)=f_{\psi _{0}(\psi_1^{k+2}(0))}(10)</math> using the fast-growing hierarchy with fundamental sequences for the extended Wilfried Buchholz's functions, where:

* <math>\psi_1^{k+2}(0)=\underbrace{\psi_1(\psi_1(\cdots(\psi_1}_{k+2\quad \psi's}(0))\cdots))</math>

* <math>k</math> is a positive integer

* <math>\psi_0, \psi_1</math> are extended Wilfried Buchholz's functions.

Names of all numbers of series 8.2 contain following codes: tetr, omm, thet.

Bitetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 2)}(10)= f_{\theta(\Omega^\Omega)}(10)</math>

Large Veblen ordinal level

Tritetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 3)}(10)</math>

Quadritetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 4)}(10)</math>

Quintitetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 5)}(10)</math>

Sextitetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 6)}(10)</math>

Septitetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 7)}(10)</math>

Octitetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 8)}(10)</math>

Nonitetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 9)}(10)</math>

Dekotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10)}(10)</math>

Hektotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 100)}(10)</math>

Kilotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{3})}(10)</math>

Megotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{6})}(10)</math>

Gigotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{9})}(10)</math>

Terotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{12})}(10)</math>

Petotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{15})}(10)</math>

Exotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{18})}(10)</math>

Zettotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{21})}(10)</math>

Yottotetrommthet <math>f_{\theta(\Omega\uparrow\uparrow 10^{24})}(10)</math>

''' Series 8.3 ''' (Omega subscript series)

In series 8.3 <math>f_{\theta (\Omega _{i})}(10)=f_{\psi _{0}(\Omega _{i}^{\Omega _{i}})}(10)=f_{\psi _{0}(\psi_i^3(0))}(10)</math> using the fast-growing hierarchy with fundamental sequences for the extended Wilfried Buchholz's functions, where:

* <math>\psi_i^3(0)=\psi_i(\psi_i(\psi_i(0)))</math>

* <math>i</math> is a positive integer

* <math>\psi_0, \psi_i</math> are extended Wilfried Buchholz's functions.

Names of all numbers of series 8.3 contain following codes: omm, thet.

Bommthet <math>f_{\theta(\Omega_2)}(10)</math>

Trommthet <math>f_{\theta(\Omega_3)}(10)</math>

Quadrommthet <math>f_{\theta(\Omega_4)}(10)</math>

Quintommthet <math>f_{\theta(\Omega_5)}(10)</math>

Sextommthet <math>f_{\theta(\Omega_6)}(10)</math>

Septommthet <math>f_{\theta(\Omega_7)}(10)</math>

Octommthet <math>f_{\theta(\Omega_8)}(10)</math>

Nonommthet <math>f_{\theta(\Omega_9)}(10)</math>

Dekommthet <math>f_{\theta(\Omega_{10})}(10)</math>

Hektommthet <math>f_{\theta(\Omega_{100})}(10)</math>

Kilommthet <math>f_{\theta(\Omega_{10^{3}})}(10)</math>

Megommthet <math>f_{\theta(\Omega_{10^{6}})}(10)</math>

Gigommthet <math>f_{\theta(\Omega_{10^{9}})}(10)</math>

Terommthet <math>f_{\theta(\Omega_{10^{12}})}(10)</math>

Petommthet <math>f_{\theta(\Omega_{10^{15}})}(10)</math>

Exommthet <math>f_{\theta(\Omega_{10^{18}})}(10)</math>

Zettommthet <math>f_{\theta(\Omega_{10^{21}})}(10)</math>

Yottommthet <math>f_{\theta(\Omega_{10^{24}})}(10)</math>

===9) Psi-series ===

For series 9.1 and 9.2 the extended Wilfried Buchholz's function <math>\psi_0</math> is used.

''' Series 9.1'''

In series 9.1 <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{k\quad\Omega's}}(10)=f_{\alpha[k]}(10)</math> using the fast-growing hierarchy with fundamental sequences for the extended Wilfried Buchholz's functions, where:

* <math>k</math> is a positive integer

* <math>\alpha[0]=1</math>

* <math>\alpha[n+1]=\psi_0(\Omega_{\alpha[n]})</math> where <math>n\geq0</math> is an integer and <math>\psi_0</math> is the extended Wilfried Buchholz's function.

Names of all numbers of series 9.1 contain following codes: mix, omm, wil.

Bimixommwil <math>f_{\psi(\Omega_{\psi(\Omega) })}(10)</math>

Trimixommwil <math>f_{\psi(\Omega_{\psi(\Omega_{\psi(\Omega) }) })}(10)</math>

Quadrimixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{4\quad\Omega's}}(10)</math>

Quintimixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{5\quad\Omega's}}(10)</math>

Sextimixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{6\quad\Omega's}}(10)</math>

Septimixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{7\quad\Omega's}}(10)</math>

Octimixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{8\quad\Omega's}}(10)</math>

Nonimixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{9\quad\Omega's}}(10)</math>

Dekomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10\quad\Omega's}}(10)</math>

Hektomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{100\quad\Omega's}}(10)</math>

Kilomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{3}\quad\Omega's}}(10)</math>

Megomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{6}\quad\Omega's}}(10)</math>

Gigomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{9}\quad\Omega's}}(10)</math>

Teromixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{12}\quad\Omega's}}(10)</math>

Petomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{15}\quad\Omega's}}(10)</math>

Exomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{18}\quad\Omega's}}(10)</math>

Zettomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{21}\quad\Omega's}}(10)</math>

Yottomixommwil <math>f_{\underbrace{\psi(\Omega_{\psi(\Omega_{\cdots_{\psi(\Omega) }\cdots})})}_{10^{24}\quad\Omega's}}(10)</math>

''' Series 9.2'''

In series 9.2 <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{k\quad\Omega's}}(10)=f_{\psi_0(\alpha[k])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the extended Wilfried Buchholz's functions, where:

* <math>k</math> is a positive integer

* <math>\alpha[0]=1</math>

* <math>\alpha[n+1]=\Omega_{\alpha[n]}</math> for all integers <math>n\geq0</math>

* <math>\psi_0</math> is the extended Wilfried Buchholz's function.

Names of all numbers of series 9.2 contain following codes: in, omm, wil.

Binommwil <math>f_{\psi_0(\Omega_{\Omega}) }(10)</math>

Trinommwil <math>f_{\psi_0(\Omega_{\Omega_{\Omega}}) }(10)</math>

Quadrinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{4\quad\Omega's}}(10)</math>

Quintinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{5\quad\Omega's}}(10)</math>

Sextinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{6\quad\Omega's}}(10)</math>

Septinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{7\quad\Omega's}}(10)</math>

Octinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{8\quad\Omega's}}(10)</math>

Noninommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{9\quad\Omega's}}(10)</math>

Dekinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10\quad\Omega's}}(10)</math>

Hektinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{100\quad\Omega's}}(10)</math>

Kilinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{3}\quad\Omega's}}(10)</math>

Meginommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{6}\quad\Omega's}}(10)</math>

Giginommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{9}\quad\Omega's}}(10)</math>

Terinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{12}\quad\Omega's}}(10)</math>

Petinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{15}\quad\Omega's}}(10)</math>

Exinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{18}\quad\Omega's}}(10)</math>

Zettinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{21}\quad\Omega's}}(10)</math>

Yottinommwil <math>f_{\underbrace{\psi_0(\Omega_{\Omega_{\cdots_{\Omega }}})}_{10^{24}\quad\Omega's}}(10)</math>

===10) <math>I_\alpha</math>-series===

The extended Wilfried Buchholz's functions are not defined for arguments larger than first omega fixed point. That is why for series 10.1 and 10.2 the Hypcos's function <math>\psi_{\Omega_1}</math> is used.

''' Series 10.1 '''

In series 10.1 <math>f_{\psi(I \uparrow \uparrow k)}(10)= f_{\psi_{\Omega_1}(\sigma[k+1])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Hypcos's functions, where:

* <math>\psi_{\Omega_1}</math> is the Hypcos's function

* <math>k>1</math> is an integer

* <math>\sigma[0]=0</math>

* <math>\sigma[n+1]=\psi_{\Omega_{I+1}}(\sigma[n])</math> where <math>n\geq0</math> is an integer and <math>I</math> is a shorthand for <math>I_1</math>

Names of all numbers of series 10.1 contain following codes: tetr, ot, os.

Bitetrotos <math>f_{\psi(I\uparrow\uparrow 2)}(10)</math>

Tritetrotos <math>f_{\psi(I\uparrow\uparrow 3)}(10)</math>

Quadritetrotos <math>f_{\psi(I\uparrow\uparrow 4)}(10)</math>

Quintitetrotos <math>f_{\psi(I\uparrow\uparrow 5)}(10)</math>

Sextitetrotos <math>f_{\psi(I\uparrow\uparrow 6)}(10)</math>

Septitetrotos <math>f_{\psi(I\uparrow\uparrow 7)}(10)</math>

Octitetrotos <math>f_{\psi(I\uparrow\uparrow 8)}(10)</math>

Nonitetrotos <math>f_{\psi(I\uparrow\uparrow 9)}(10)</math>

Dekotetrotos <math>f_{\psi(I\uparrow\uparrow 10)}(10)</math>

Hektotetrotos <math>f_{\psi(I\uparrow\uparrow 100)}(10)</math>

Kilotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{3})}(10)</math>

Megotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{6})}(10)</math>

Gigotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{9})}(10)</math>

Terotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{12})}(10)</math>

Petotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{15})}(10)</math>

Exotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{18})}(10)</math>

Zettotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{21})}(10)</math>

Yottotetrotos <math>f_{\psi(I\uparrow\uparrow 10^{24})}(10)</math>

''' Series 10.2 '''

In series 10.2 <math>f_{\psi(\lambda[k])}(10)=f_{\psi_{\Omega_1}(\lambda[k])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the Hypcos's functions, where:

* <math>k</math> is a natural number

* <math>\lambda[0]=1</math>

* <math>\lambda[n+1]=I_{\lambda[n]}</math> for all integers <math>n\geq0</math>

* <math>\psi_{\Omega_1}</math> is the Hypcos's function.

Names of all numbers of series 10.2 contain following codes: in, ot, os.

Uninotos <math>f_{\psi(\lambda[2])}(10)</math>

Binotos <math>f_{\psi(\lambda[3])}(10)</math>

Trinotos <math>f_{\psi(\lambda[4])}(10)</math>

Quadrinotos <math>f_{\psi(\lambda[5])}(10)</math>

Quintinotos <math>f_{\psi(\lambda[6])}(10)</math>

Sextinotos <math>f_{\psi(\lambda[7])}(10)</math>

Septinotos <math>f_{\psi(\lambda[8])}(10)</math>

Octinotos <math>f_{\psi(\lambda[9])}(10)</math>

Noninotos <math>f_{\psi(\lambda[10])}(10)</math>

Dekinotos <math>f_{\psi(\lambda[11])}(10)</math>

Hektinotos <math>f_{\psi(\lambda[101])}(10)</math>

Kilinotos <math>f_{\psi(\lambda[1001])}(10)</math>

Meginotos <math>f_{\psi(\lambda[10^{6}+1])}(10)</math>

Giginotos <math>f_{\psi(\lambda[10^{9}+1])}(10)</math>

Terinotos <math>f_{\psi(\lambda[10^{12}+1])}(10)</math>

Petinotos <math>f_{\psi(\lambda[10^{15}+1])}(10)</math>

Exinotos <math>f_{\psi(\lambda[10^{18}+1])}(10)</math>

Zettinotos <math>f_{\psi(\lambda[10^{21}+1])}(10)</math>

Yottinotos <math>f_{\psi(\lambda[10^{24}+1])}(10)</math>

===11) <math>I(\alpha,\beta)</math>-series===

For series 11.1 and 11.2 the function collapsing <math>\alpha</math>-weakly inaccessible cardinals <math>\psi_{I(0,0)}</math> is used.

''' Series 11.1'''

In series 11.1 <math>f_{\psi(I(n,0))}(10)=f_{\psi_{I(0,0)}(I(n,0))}(10)</math> using the fast-growing hierarchy with fundamental sequences for the functions collapsing <math>\alpha</math>-weakly inaccessible cardinals, where:

* <math>n</math> is a natural number

* <math>\psi_{I(0,0)}</math> is the function collapsing <math>\alpha</math>-weakly inaccessible cardinals.

Names of all numbers of series 11.1 contain following codes: im, ah.

Unimah <math>f_{\psi(I(1,0))}(10)</math>

Bimah <math>f_{\psi(I(2,0))}(10)</math>

Trimah <math>f_{\psi(I(3,0))}(10)</math>

Quadrimah <math>f_{\psi(I(4,0))}(10)</math>

Quintimah <math>f_{\psi(I(5,0))}(10)</math>

Sextimah <math>f_{\psi(I(6,0))}(10)</math>

Septimah <math>f_{\psi(I(7,0))}(10)</math>

Octimah <math>f_{\psi(I(8,0))}(10)</math>

Nonimah <math>f_{\psi(I(9,0))}(10)</math>

Dekimah <math>f_{\psi(I(10,0))}(10)</math>

Hektimah <math>f_{\psi(I(100,0))}(10)</math>

Kilimah <math>f_{\psi(I(10^{3},0))}(10)</math>

Megimah <math>f_{\psi(I(10^{6},0))}(10)</math>

Gigimah <math>f_{\psi(I(10^{9},0))}(10)</math>

Terimah <math>f_{\psi(I(10^{12},0))}(10)</math>

Petimah <math>f_{\psi(I(10^{15},0))}(10)</math>

Eximah <math>f_{\psi(I(10^{18},0))}(10)</math>

Zettimah <math>f_{\psi(I(10^{21},0))}(10)</math>

Yottimah <math>f_{\psi(I(10^{24},0))}(10)</math>

''' Series 11.2'''

In series 11.2 <math>f_{\psi(\tau[k])}(10)=f_{\psi_{I(0,0)}(\tau[k])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the functions collapsing <math>\alpha</math>-weakly inaccessible cardinals, where:

* <math>k</math> is a natural number

* <math>\tau[0]=I(0,0)</math>

* <math>\tau[n+1]=I(\tau[n],0)</math> for all integers <math>n\geq0</math>

* <math>\psi_{I(0,0)}</math> is the function collapsing <math>\alpha</math>-weakly inaccessible cardinals.

Names of all numbers of series 11.2 contain following codes: in, im, ah.

Uninimah <math>f_{\psi(\tau[1])}(10)</math>

Binimah <math>f_{\psi(\tau[2])}(10)</math>

Trinimah <math>f_{\psi(\tau[3])}(10)</math>

Quadrinimah <math>f_{\psi(\tau[4])}(10)</math>

Quintinimah <math>f_{\psi(\tau[5])}(10)</math>

Sextinimah <math>f_{\psi(\tau[6])}(10)</math>

Septinimah <math>f_{\psi(\tau[7])}(10)</math>

Octinimah <math>f_{\psi(\tau[8])}(10)</math>

Noninimah <math>f_{\psi(\tau[9])}(10)</math>

Dekinimah <math>f_{\psi(\tau[10])}(10)</math>

Hektinimah <math>f_{\psi(\tau[100])}(10)</math>

Kilinimah <math>f_{\psi(\tau[10^{3}])}(10)</math>

Meginimah <math>f_{\psi(\tau[10^{6}])}(10)</math>

Giginimah <math>f_{\psi(\tau[10^{9}])}(10)</math>

Terinimah <math>f_{\psi(\tau[10^{12}])}(10)</math>

Petinimah <math>f_{\psi(\tau[10^{15}])}(10)</math>

Exinimah <math>f_{\psi(\tau[10^{18}])}(10)</math>

Zettinimah <math>f_{\psi(\tau[10^{21}])}(10)</math>

Yottinimah <math>f_{\psi(\tau[10^{24}])}(10)</math>

===12) M-series===

For series 12.1 and 12.2 the function collapsing weakly Mahlo cardinals <math>\psi_{\alpha}</math> where <math>\alpha=\chi_{M_1}(0)</math> is used.

''' Series 12.1'''

In series 12.1 <math>f_{\psi (M\uparrow \uparrow k)}(10)=f_{\psi _{\alpha }(\beta [k])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the function collapsing weakly Mahlo cardinals, where:

* <math>k>1</math> is an integer

* <math>\alpha=\chi_{M_1}(0)</math> and <math>\psi_\alpha</math> is the function collapsing weakly Mahlo cardinals

* <math>\beta[0]=M_1</math>

* <math>\beta[n+1]=\psi_{\gamma}(\beta[n])</math> where <math>n\geq0</math> is an integer and <math>\gamma=\chi_{M_2}(1)=\Omega_{M+1}</math>

Names of all numbers of series 12.1 contain following codes: tetr, em, ar.

Bitetremar <math>f_{\psi(M\uparrow\uparrow 2)}(10)</math>

Tritetremar <math>f_{\psi(M\uparrow\uparrow 3)}(10)</math>

Quadritetremar <math>f_{\psi(M\uparrow\uparrow 4)}(10)</math>

Quintitetremar <math>f_{\psi(M\uparrow\uparrow 5)}(10)</math>

Sextitetremar <math>f_{\psi(M\uparrow\uparrow 6)}(10)</math>

Septitetremar <math>f_{\psi(M\uparrow\uparrow 7)}(10)</math>

Octitetremar <math>f_{\psi(M\uparrow\uparrow 8)}(10)</math>

Nonitetremar <math>f_{\psi(M\uparrow\uparrow 9)}(10)</math>

Dekotetremar <math>f_{\psi(M\uparrow\uparrow 10)}(10)</math>

Hektotetremar <math>f_{\psi(M\uparrow\uparrow 100)}(10)</math>

Kilotetremar <math>f_{\psi(M\uparrow\uparrow 10^{3})}(10)</math>

Megotetremar <math>f_{\psi(M\uparrow\uparrow 10^{6})}(10)</math>

Gigotetremar <math>f_{\psi(M\uparrow\uparrow 10^{9})}(10)</math>

Terotetremar <math>f_{\psi(M\uparrow\uparrow 10^{12})}(10)</math>

Petotetremar <math>f_{\psi(M\uparrow\uparrow 10^{15})}(10)</math>

Exotetremar <math>f_{\psi(M\uparrow\uparrow 10^{18})}(10)</math>

Zettotetremar <math>f_{\psi(M\uparrow\uparrow 10^{21})}(10)</math>

Yottotetremar <math>f_{\psi(M\uparrow\uparrow 10^{24})}(10)</math>

''' Series 12.2'''

In series 12.2 <math>f_{\underbrace {\psi (M_{M_{..._{M}}})} _{k\quad M's}}(10)=f_{\psi _{\alpha }(\beta [k])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the function collapsing weakly Mahlo cardinals, where:

* <math>k</math> is a positive integer

* <math>\alpha=\chi_{M_1}(0)</math> and <math>\psi_\alpha</math> is the function collapsing weakly Mahlo cardinals

* <math>\beta[0]=1</math>

* <math>\beta[n+1]=M_{\beta[n]}</math> for all integers <math>n\geq0</math>

Names of all numbers of series 12.2 contain following codes: in, em, ar.

Uninemar <math>f_{\psi(M_{M})}(10)</math>

Binemar <math>f_{\psi(M_{M_{M}})}(10)</math>

Trinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{4 \quad M's}}(10)</math>

Quadrinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{5 \quad M's}}(10)</math>

Quintinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{6 \quad M's}}(10)</math>

Sextinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{7 \quad M's}}(10)</math>

Septinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{8 \quad M's}}(10)</math>

Octinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{9 \quad M's}}(10)</math>

Noninemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10 \quad M's}}(10)</math>

Dekinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{11 \quad M's}}(10)</math>

Hektinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{101 \quad M's}}(10)</math>

Kilinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{3}+1 \quad M's}}(10)</math>

Meginemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{6}+1 \quad M's}}(10)</math>

Giginemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{9}+1 \quad M's}}(10)</math>

Terinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{12}+1 \quad M's}}(10)</math>

Petinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{15}+1 \quad M's}}(10)</math>

Exinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{18}+1 \quad M's}}(10)</math>

Zettinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{21}+1 \quad M's}}(10)</math>

Yottinemar <math>f_{\underbrace{\psi(M_{M_{..._{M}}})}_{10^{24}+1 \quad M's}}(10)</math>

''' Series 12.3'''

In series 12.3 <math>f_{\psi (\upsilon [k])}(10)=f_{\psi _{M(0;0)}(\upsilon [k])}(10)</math> using the fast-growing hierarchy with fundamental sequences for the function collapsing <math>M(\alpha;\beta)</math>, where:

* <math>k</math> is a natural number

* <math>M(0;0)</math> is the first 0-weakly Mahlo cardinal

* <math>\upsilon[0]=M(0;0)</math>

* <math>\upsilon[n+1]=M(\upsilon[n];0)</math> for all integers <math>n\geq0</math>

* <math>\psi_{M(0;0)}</math> is the function collapsing <math>M(\alpha;\beta)</math>

Names of all numbers of series 12.3 contain following codes: in, am, us.

Uninamus <math>f_{\psi(\upsilon[1])}(10)</math>

Binamus <math>f_{\psi(\upsilon[2])}(10)</math>

Trinamus <math>f_{\psi(\upsilon[3])}(10)</math>

Quadrinamus <math>f_{\psi(\upsilon[4])}(10)</math>

Quintinamus <math>f_{\psi(\upsilon[5])}(10)</math>

Sextinamus <math>f_{\psi(\upsilon[6])}(10)</math>

Septinamus <math>f_{\psi(\upsilon[7])}(10)</math>

Octinamus <math>f_{\psi(\upsilon[8])}(10)</math>

Noninamus <math>f_{\psi(\upsilon[9])}(10)</math>

Dekinamus <math>f_{\psi(\upsilon[10])}(10)</math>

Hektinamus <math>f_{\psi(\upsilon[100])}(10)</math>

Kilinamus <math>f_{\psi(\upsilon[10^{3}])}(10)</math>

Meginamus <math>f_{\psi(\upsilon[10^{6}])}(10)</math>

Giginamus <math>f_{\psi(\upsilon[10^{9}])}(10)</math>

Terinamus <math>f_{\psi(\upsilon[10^{12}])}(10)</math>

Petinamus <math>f_{\psi(\upsilon[10^{15}])}(10)</math>

Exinamus <math>f_{\psi(\upsilon[10^{18}])}(10)</math>

Zettinamus <math>f_{\psi(\upsilon[10^{21}])}(10)</math>

Yottinamus <math>f_{\psi(\upsilon[10^{24}])}(10)</math>

===13) Tar series===

To go even further let's use Taranovsky's notation. Definition of the notation was published here:

* <nowiki> http://web.mit.edu/dmytro/www/other/OrdinalNotation.htm </nowiki>

* <nowiki> https://stepstowardinfinity.wordpress.com/2015/06/22/ordinal3/ </nowiki>

My system of number names generates too complicated names for case of using of Taranovsky's notation and that is why all names of numbers from series 13.1 and 13.2 although were created according this system, but, unlike previous series, without strict compliance with its rules.

Also let's define the auxiliary function <math>Tar(a)</math> to simplify the generation of names of numbers.

Let <math>Tar(a)=f_{\underbrace{C(C(\cdots(C(C(\Omega_{a}2,0),0),\cdots ),0)}_{a\quad C's}}(a)</math> using the fast-growing hierarchy and the following fundamental sequences for Taranovsky’s notation:

Let <math>L(\alpha)</math> be the amount of C's in standard representation of <math>\alpha</math>, then <math>\alpha[n]=\max\{\beta|\beta<\alpha\land L(\beta)\le L(\alpha)+n\}</math>

''' Series 13.1'''

Tritar <math>Tar(3)=f_{C(C(C(\Omega_{3} 2,0),0),0)}(3)</math>

Quadritar <math>Tar(4)=f_{C(C(C(C(\Omega_{4} 2,0),0),0),0)}(4)</math>

Quintitar <math>Tar(5)=f_{\underbrace{C(C(\cdots C(\Omega_{5} 2,0)\cdots,0),0)}_{5 \quad C's}}(5)</math>

Sextitar <math>f_{\underbrace{C(C(\cdots C(\Omega_{6} 2,0)\cdots,0),0)}_{6 \quad C's}}(6)</math>

Septitar <math>f_{\underbrace{C(C(\cdots C(\Omega_{7} 2,0)\cdots,0),0)}_{7 \quad C's}}(7)</math>

Octitar <math>f_{\underbrace{C(C(\cdots C(\Omega_{8} 2,0)\cdots,0),0)}_{8 \quad C's}}(8)</math>

Nonitar <math>f_{\underbrace{C(C(\cdots C(\Omega_{9} 2,0)\cdots,0),0)}_{9 \quad C's}}(9)</math>

Dekotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10} 2,0)\cdots,0),0)}_{10 \quad C's}}(10)</math>

Hektotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{100} 2,0)\cdots,0),0)}_{100 \quad C's}}(100)</math>

Kilotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{3}} 2,0)\cdots,0),0)}_{10^{3} \quad C's}}(10^{3})</math>

Megotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{6}} 2,0)\cdots,0),0)}_{10^{6} \quad C's}}(10^{6})</math>

Gigotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{9}} 2,0)\cdots,0),0)}_{10^{9} \quad C's}}(10^{9})</math>

Terotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{12}} 2,0)\cdots,0),0)}_{10^{12} \quad C's}}(10^{12})</math>

Petotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{15}} 2,0)\cdots,0),0)}_{10^{15} \quad C's}}(10^{15})</math>

Exotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{18}} 2,0)\cdots,0),0)}_{10^{18} \quad C's}}(10^{18})</math>

Zettotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{21}} 2,0)\cdots,0),0)}_{10^{21} \quad C's}}(10^{21})</math>

Yottotar <math>f_{\underbrace{C(C(\cdots C(\Omega_{10^{24}} 2,0)\cdots,0),0)}_{10^{24} \quad C's}}(10^{24})</math>

''' Series 13.2'''

Let <math>Tar=Tar(10)=f_{\underbrace{C(C(\cdots(C(C(\Omega_{10}2,0),0),\cdots ),0)}_{10\quad C's}}(10)= Dekotar</math>

Unintar <math>Tar(Tar)=f_{\underbrace{C(C(\cdots(C(C(\Omega_{Dekotar}2,0),0),\cdots ),0)}_{Dekotar\quad C's}}(Dekotar)</math>

Bintar <math>Tar(Tar(Tar))=f_{\underbrace{C(C(\cdots(C(C(\Omega_{Unintar}2,0),0),\cdots ),0)}_{Unintar\quad C's}}(Unintar)</math>

Trintar <math>\underbrace{Tar(\cdots (Tar)\cdots)}_{3\quad pairs \quad of \quad brackets}=f_{\underbrace{C(C(\cdots(C(C(\Omega_{Bintar}2,0),0),\cdots ),0)}_{Bintar\quad C's}}(Bintar)</math>

Quadrintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{4\quad pairs \quad of \quad brackets}=</math>

<math>=f_{\underbrace{C(C(\cdots(C(C(\Omega_{Trintar}2,0),0),\cdots ),0)}_{Trintar\quad C's}}(Trintar)</math>

Quintintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{5\quad pairs \quad of \quad brackets}</math>

Sextintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{6\quad pairs \quad of \quad brackets}</math>

Septintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{7\quad pairs \quad of \quad brackets}</math>

Octintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{8\quad pairs \quad of \quad brackets}</math>

Nonintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{9\quad pairs \quad of \quad brackets}</math>

Dekintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10\quad pairs \quad of \quad brackets}</math>

Hektintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{100\quad pairs \quad of \quad brackets}</math>

Kilintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{3}\quad pairs \quad of \quad brackets}</math>

Megintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{6}\quad pairs \quad of \quad brackets}</math>

Gigintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{9}\quad pairs \quad of \quad brackets}</math>

Terintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{12}\quad pairs \quad of \quad brackets}</math>

Petintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{15}\quad pairs \quad of \quad brackets}</math>

Exintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{18}\quad pairs \quad of \quad brackets}</math>

Zettintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{21}\quad pairs \quad of \quad brackets}</math>

Yottintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{10^{24}\quad pairs \quad of \quad brackets}</math>

Tarintar <math>\underbrace{Tar(Tar(\cdots(Tar)\cdots))}_{Tar\quad pairs \quad of \quad brackets}=\underbrace{Tar(Tar(\cdots(Tar}_{Dekotar\quad Tar's}(Dekotar))\cdots))</math>

==Section XI. References==

* <nowiki>http://www.sciencedirect.com/science/article/pii/0168007286900527</nowiki>

* <nowiki>https://googology.wikia.com/wiki/User:Hyp_cos/OCF_vs_Array_Notation#Using_weakly_inaccessibles</nowiki>

* <nowiki>https://googology.wikia.com/wiki/User:Hyp_cos/OCF_vs_Array_Notation#Using_weakly_Mahlos</nowiki>

Original of this publication is the post in my blog (31.05.2016, googology.wikia):

<nowiki>https://googology.wikia.com/wiki/User_blog:Denis_Maksudov/My_system_of_number_names_(Fast_Growing_Series,_FGS)</nowiki>

Original of this publication (31.05.2016, my blog on googology.wikia)