# Multiple expanding array notation

Multiple expanding array notation (mEAN) is the fourth part of my array notation. In this page, first I introduce higher expanding arrays to you, then I change the rules a little, to form the complete definition.

# Higher expanding arrays

In step 3 of case B2, we find an innermost separator without grave accents for the grave accent. Now I introduce a new separator – the double grave accent ( ). We find an innermost separator with a grave accent for it, and it also reduces in the case B2 way. For example, s(a,b{1{1 3}3}3) = s(a,b{1{1{1…{1{1,2 2}2 2}…2 2}2 2}2{1 3}2}2{1{1 3}3}2) with b-1 2 2}′s.

The next step is separators with 2 grave accents at the left-superscript position of the rbrace. And the double grave accent is just a shorthand for {1 }. Nothing changes, but the only notable thing is that we find an innermost separator with exactly one grave accent for the double grave accent.

What’s the next thing is very clear now. Triple grave accent (  ), and separators with 3 grave accents at the left-superscript position of the rbrace. And so on, m-ple grave accent, and separators with m grave accents at the left-superscript position of the rbrace. Generally, an m-ple grave accent reduces in the case B2 way, but we find an innermost separator with m-1 grave accents for it.

So here comes the process.

## Process

Case B1, B2 and B4 are terminal but case A and B3 are not. And note that b, n, m, M, Bt and K are parts of the original array but t, i, Si, At, P and Q are not. First start from the 3rd entry.

• Case A: If the entry is 1, then you jump to the next entry.
• Case B: If the entry n is not 1, look to your left:
• Case B1: If the comma is immediately before you, then
1. Change the “1,n” into “b,n-1” where n is this non-1 entry and the b is the iterator.
2. Change all the entries at base layer before them into the base.
3. The process ends.
• Case B2: If the m-ple grave accent M (M =  … or {1 …} with m grave accents) is immediately before you, then
1. Let t be such that “M is at layer t”.
2. Repeat this:
1. Subtract t by 1.
2. Let separator Bt be such that it’s at layer t, and M is inside it.
3. If t = 1, then break the repeating, or else continue repeating.
3. Find the maximum of t such that At has exactly m-1 grave accents at the left-superscript position of the rbrace.
4. Let string P and Q be such that Bt = “P M n Q”
5. Change Bt into Sb, where b is the iterator, S1 is comma, and Si+1 = “P 1 Si 2 M n-1 Q”
6. The process ends.
• Case B3: If a separator K that is neither comma nor grave accent is immediately before you, then
1. Change the “K n” into “K 2 K n-1”.
2. Set separator At = K, here K is at layer t.
3. Jump to the first entry of the former K.
• Case B4: If an lbrace is immediately before you, then
1. Change separator {n #} into string Sb, where b is the iterator, S1 = “{n-1 #}” and Si+1 = “Si 1 {n-1 #}”.
2. The process ends.

## Explanation

The process has only a small change. Just note that if m = 1, the step 3 of case B2 also works correctly, because a separator with 0 grave accent is just a separator without any grave accents at the left-superscript position of the rbrace.

An m-ple grave accent searches for a separator with m-1 grave accents, and then it expands into b nests of it. That’s why this notation is named multiple expanding array notation.

## Comparison

s(n,n{1{1 2}2}2) has growth rate ${\theta(\varepsilon_{\Omega+1},0)}$, so it eventually outgrows all functions provably recursive in Kripke-Platek set theory with the axiom of infinity (KP), Aczel’s constructive Zermelo-Fraenkel set theory (CZF), the theory of inductive definitions (ID1), and Martin-Löf Type Theory with indexed W-Types (MLW). It’s also comparable to the H(n) in BAN. And then,

{1 {1 2} 3} has recursion level ${\theta(\varepsilon_{\Omega+1},1)}$
{1 {1 2} 12} has recursion level ${\theta(\varepsilon_{\Omega+1}+1,0)}$
{1 {1 2} 1 {1 2} 2} has recursion level ${\theta(\varepsilon_{\Omega+1}2,0)}$
{1 {2 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+1},0)}$
{1 {12 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega},0)}$
{1 {13 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega2},0)}$
{1 {112 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega^2},0)}$
{1 {1 {2} 2 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega^\omega},0)}$
{1 {1 {12} 2 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega^\Omega},0)}$
{1 {1 {112} 2 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega^{\Omega^\Omega}},0)}$
{1 {1 {1 {12} 2} 2 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}+\Omega^{\Omega^{\Omega^\Omega}}},0)}$
{1 {1 {1 2} 2 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}2},0)}$
{1 {1 {1 2} 3 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega+1}3},0)}$
{1 {1 {1 2} 12 2} 2} has recursion level ${\theta(\omega^{\omega^{\varepsilon_{\Omega+1}+\Omega}},0)}$
{1 {1 {1 2} 1 {1 2} 2 2} 2} has recursion level ${\theta(\omega^{\omega^{\varepsilon_{\Omega+1}2}},0)}$
{1 {1 {2 2} 2 2} 2} has recursion level ${\theta(\omega^{\omega^{\omega^{\varepsilon_{\Omega+1}+1}}},0)}$
{1 {1 {1 {1 2} 2 2} 2 2} 2} has recursion level ${\theta(\omega^{\omega^{\omega^{\varepsilon_{\Omega+1}2}}},0)}$
{1 {1 {1 {1 {1 2} 2 2} 2 2} 2 2} 2} has recursion level ${\theta(\omega^{\omega^{\omega^{\omega^{\omega^{\varepsilon_{\Omega+1}2}}}}},0)}$
{1 {1 3} 2} has recursion level ${\theta(\varepsilon_{\Omega+2},0)}$
{1 {1 4} 2} has recursion level ${\theta(\varepsilon_{\Omega+3},0)}$
{1 {1 1,2} 2} has recursion level ${\theta(\varepsilon_{\Omega+\omega},0)}$
{1 {1 1 {1 {1 2} 2} 2} 2} has recursion level ${\theta(\varepsilon_{\Omega+\theta(\varepsilon_{\Omega+1},0)},0)}$
{1 {1 12} 2} has recursion level ${\theta(\varepsilon_{\Omega2},0)}$
{1 {1 22} 2} has recursion level ${\theta(\varepsilon_{\Omega2+1},0)}$
{1 {1 13} 2} has recursion level ${\theta(\varepsilon_{\Omega3},0)}$
{1 {1 11,2} 2} has recursion level ${\theta(\varepsilon_{\Omega\omega},0)}$
{1 {1 11 {1 {1 12} 2} 2} 2} has recursion level ${\theta(\varepsilon_{\Omega\theta(\varepsilon_{\Omega2},0)},0)}$
{1 {1 112} 2} has recursion level ${\theta(\varepsilon_{\Omega^2},0)}$
{1 {1 1 {2} 2} 2} has recursion level ${\theta(\varepsilon_{\Omega^\omega},0)}$
{1 {1 1 {12} 2} 2} has recursion level ${\theta(\varepsilon_{\Omega^\Omega},0)}$
{1 {1 1 {112} 2} 2} has recursion level ${\theta(\varepsilon_{\Omega^{\Omega^\Omega}},0)}$
{1 {1 1 {1 {12} 2} 2} 2} has recursion level ${\theta(\varepsilon_{\Omega^{\Omega^{\Omega^\Omega}}},0)}$
{1 {1 1 {1 2} 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\Omega+1}},0)}$
{1 {1 2 {1 2} 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\Omega+1}+1},0)}$
{1 {1 1 {1 2} 3} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\Omega+1}2},0)}$
{1 {1 1 {2 2} 2} 2} has recursion level ${\theta(\varepsilon_{\omega^{\omega^{\varepsilon_{\Omega+1}+1}}},0)}$
{1 {1 1 {1 3} 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\Omega+2}},0)}$
{1 {1 1 {1 12} 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\Omega2}},0)}$
{1 {1 1 {1 1 {1 2} 2} 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\varepsilon_{\Omega+1}}},0)}$
{1 {1 1 2} 2} has recursion level ${\theta(\varphi(2,\Omega+1),0)=\theta(\theta(2,\Omega),0)}$
{1 {1 2 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(2,\Omega+1)+1},0)}$
{1 {1 12 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(2,\Omega+1)+\Omega},0)}$
{1 {1 1 {1 2} 2 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(2,\Omega+1)+\varepsilon_{\Omega+1}},0)}$
{1 {1 1 {1 1 2} 2 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(2,\Omega+1)2},0)}$
{1 {1 1 {1 1 2} 3 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(2,\Omega+1)3},0)}$
{1 {1 1 {2 1 2} 2 2} 2} has recursion level ${\theta(\varepsilon_{\omega^{\omega^{\varphi(2,\Omega+1)+1}}},0)}$
{1 {1 1 {1 2 2} 2 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\varphi(2,\Omega+1)+1}},0)}$
{1 {1 1 {1 1 {1 1 2} 2 2} 2 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\varphi(2,\Omega+1)2}},0)}$
{1 {1 1 {1 1 {1 2 2} 2 2} 2 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\varepsilon_{\varphi(2,\Omega+1)+1}}},0)}$
{1 {1 1 3} 2} has recursion level ${\theta(\varphi(2,\Omega+2),0)}$
{1 {1 1 4} 2} has recursion level ${\theta(\varphi(2,\Omega+3),0)}$
{1 {1 1 12} 2} has recursion level ${\theta(\varphi(2,\Omega2),0)}$
{1 {1 1 1 {1 1 2} 2} 2} has recursion level ${\theta(\varphi(2,\varphi(2,\Omega+1)),0)}$
{1 {1 1 1 2} 2} has recursion level ${\theta(\varphi(3,\Omega+1),0)}$
{1 {1 2 1 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(3,\Omega+1)+1},0)}$
{1 {1 1 2 2} 2} has recursion level ${\theta(\varphi(2,\varphi(3,\Omega+1)+1),0)}$
{1 {1 1 1 3} 2} has recursion level ${\theta(\varphi(3,\Omega+2),0)}$
{1 {1 1 1 1 2} 2} has recursion level ${\theta(\varphi(4,\Omega+1),0)}$
{1 {1 1 1 1 1 2} 2} has recursion level ${\theta(\varphi(5,\Omega+1),0)}$
{1 {1 {2 } 2} 2} has recursion level ${\theta(\varphi(\omega,\Omega+1),0)}$
{1 {1 2 {2 } 2} 2} has recursion level ${\theta(\varepsilon_{\varphi(\omega,\Omega+1)+1},0)}$
{1 {1 1 2 {2 } 2} 2} has recursion level ${\theta(\varphi(2,\varphi(\omega,\Omega+1)+1),0)}$
{1 {1 {2 } 3} 2} has recursion level ${\theta(\varphi(\omega,\Omega+2),0)}$
{1 {1 {2 } 12} 2} has recursion level ${\theta(\varphi(\omega,\Omega2),0)}$
{1 {1 {2 } 1 {1 2} 2} 2} has recursion level ${\theta(\varphi(\omega,\varepsilon_{\Omega+1}),0)}$
{1 {1 {2 } 1 {1 1 2} 2} 2} has recursion level ${\theta(\varphi(\omega,\varphi(2,\Omega+1)),0)}$
{1 {1 {2 } 1 {1 {2 } 2} 2} 2} has recursion level ${\theta(\varphi(\omega,\varphi(\omega,\Omega+1)),0)}$
{1 {1 {2 } 1 {1 {2 } 1 {1 {2 } 2} 2} 2} 2} has recursion level ${\theta(\varphi(\omega,\varphi(\omega,\varphi(\omega,\Omega+1))),0)}$
{1 {1 {2 } 1 2} 2} has recursion level ${\theta(\varphi(\omega+1,\Omega+1),0)}$
{1 {1 {2 } 1 1 2} 2} has recursion level ${\theta(\varphi(\omega+2,\Omega+1),0)}$
{1 {1 {2 } 1 {2 } 2} 2} has recursion level ${\theta(\varphi(\omega2,\Omega+1),0)}$
{1 {1 {3 } 2} 2} has recursion level ${\theta(\varphi(\omega^2,\Omega+1),0)}$
{1 {1 {1,2 } 2} 2} has recursion level ${\theta(\varphi(\omega^\omega,\Omega+1),0)}$
{1 {1 {1 {1 {1 {2 } 2} 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\theta(\varphi(\omega,\Omega+1),0),\Omega+1),0)}$
{1 {1 {12 } 2} 2} has recursion level ${\theta(\varphi(\Omega,1),0)=\theta(\theta(\Omega,\Omega),0)}$
{1 {1 {12 } 3} 2} has recursion level ${\theta(\varphi(\Omega,2),0)}$
{1 {1 {12 } 12} 2} has recursion level ${\theta(\varphi(\Omega,\Omega),0)}$
{1 {1 {12 } 1 {1 {12 } 2} 2} 2} has recursion level ${\theta(\varphi(\Omega,\varphi(\Omega,1)),0)}$
{1 {1 {12 } 1 2} 2} has recursion level ${\theta(\varphi(\Omega+1,0),0)}$
{1 {1 {12 } 1 1 2} 2} has recursion level ${\theta(\varphi(\Omega+2,0),0)}$
{1 {1 {12 } 1 {2 } 2} 2} has recursion level ${\theta(\varphi(\Omega+\omega,0),0)}$
{1 {1 {12 } 1 {12 } 2} 2} has recursion level ${\theta(\varphi(\Omega2,0),0)}$
{1 {1 {22 } 2} 2} has recursion level ${\theta(\varphi(\Omega\omega,0),0)}$
{1 {1 {13 } 2} 2} has recursion level ${\theta(\varphi(\Omega^2,0),0)}$
{1 {1 {112 } 2} 2} has recursion level ${\theta(\varphi(\Omega^\Omega,0),0)}$
{1 {1 {1 {12} 2 } 2} 2} has recursion level ${\theta(\varphi(\Omega^{\Omega^\Omega},0),0)}$
{1 {1 {1 {1 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\varepsilon_{\Omega+1},0),0)}$
{1 {1 {1 {1 3} 2 } 2} 2} has recursion level ${\theta(\varphi(\varepsilon_{\Omega+2},0),0)}$
{1 {1 {1 {1 1 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\varphi(2,\Omega+1),0),0)}$
{1 {1 {1 {1 {2 } 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\varphi(\omega,\Omega+1),0),0)}$
{1 {1 {1 {1 {12 } 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\varphi(\Omega,1),0),0)}$
{1 {1 {1 {1 {1 {1 2} 2 } 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\varphi(\varepsilon_{\Omega+1},0),0),0)}$
{1 {1 {1 {1 {1 {1 {1 {1 2} 2 } 2} 2 } 2} 2 } 2} 2} has recursion level ${\theta(\varphi(\varphi(\varphi(\varepsilon_{\Omega+1},0),0),0),0)}$
{1 {1 {1 2 } 2} 2} has recursion level ${\theta(\Gamma_{\Omega+1},0)=\theta(\Omega_2,0)}$
{1 {1 {1 2 } 2} 3} has recursion level ${\theta(\Omega_2,1)}$
{1 {1 {1 2 } 2} 12} has recursion level ${\theta(\Omega_2+1,0)}$
{1 {1 {1 2 } 2} 1 {12} 2} has recursion level ${\theta(\Omega_2+\Omega,0)}$
{1 {1 {1 2 } 2} 1 {1 {2 } 2} 2} has recursion level ${\theta(\Omega_2+\varphi(\omega,\Omega+1),0)}$
{1 {1 {1 2 } 2} 1 {1 {12 } 2} 2} has recursion level ${\theta(\Omega_2+\varphi(\Omega,1),0)}$
{1 {1 {1 2 } 2} 1 {1 {1 {1 {2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\varphi(\varphi(\omega,\Omega+1),0),0)}$
{1 {1 {1 2 } 2} 1 {1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\Gamma_{\Omega+1},0)=\theta(\Omega_2+\theta(\Omega_2,\Omega),0)}$
{1 {1 {1 2 } 2} 1 {1 {1 2 } 2} 12} has recursion level ${\theta(\Omega_2+\theta(\Omega_2,\Omega)+1,0)}$
{1 {1 {1 2 } 2} 1 {1 {1 2 } 2} 1 {1 {2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2,\Omega)+\theta(\omega,\Omega),0)}$
{1 {1 {1 2 } 2} 1 {1 {1 2 } 2} 1 {1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2,\Omega)2,0)}$
{1 {2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\omega^{\theta(\Omega_2,\Omega)+1},0)}$
{1 {1 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\varepsilon_{\theta(\Omega_2,\Omega)+1},0)}$
{1 {1 {2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\omega,\theta(\Omega_2,\Omega)+1),0)}$
{1 {1 {12 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega,\theta(\Omega_2,\Omega)+1),0)}$
{1 {1 {1 {1 2} 2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\varepsilon_{\Omega+1},\theta(\Omega_2,\Omega)+1),0)}$
{1 {1 {1 {1 {2 } 2} 2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\theta(\omega,\Omega),\theta(\Omega_2,\Omega)+1),0)}$
{1 {1 {1 {1 {1 {1 {2 } 2} 2 } 2} 2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\theta(\theta(\omega,\Omega),\Omega),\theta(\Omega_2,\Omega)+1),0)}$
{1 {1 {1 {1 {1 2 } 2} 2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\theta(\Omega_2,\Omega),\Omega+1),0)}$
{1 {1 {1 {1 {1 {1 {1 2 } 2} 2 } 2 {1 2 } 2} 2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\theta(\theta(\Omega_2,\Omega),\Omega+1),\Omega),0)}$
{1 {1 {1 2 } 3} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2,\Omega+1),0)}$
{1 {1 {1 2 } 12} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2,\Omega2),0)}$
{1 {1 {1 2 } 1 {1 {1 2 } 2} 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2,\theta(\Omega_2,\Omega)),0)}$
{1 {1 {1 2 } 1 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+1,\Omega),0)}$
{1 {1 {1 2 } 1 {2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\omega,\Omega),0)}$
{1 {1 {1 2 } 1 {12 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\Omega,\Omega),0)}$
{1 {1 {1 2 } 1 {1 {1 {2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\theta(\omega,\Omega),\Omega),0)}$
{1 {1 {1 2 } 1 {1 {1 {1 {1 {2 } 2} 2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\theta(\theta(\omega,\Omega),\Omega),\Omega),0)}$
{1 {1 {1 2 } 1 {1 {1 {1 2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\theta(\Omega_2,\Omega),\Omega),0)}$
{1 {1 {1 2 } 1 {1 {1 {1 2 } 3} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\theta(\Omega_2,\Omega+1),\Omega),0)}$
{1 {1 {1 2 } 1 {1 {1 {1 2 } 1 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\theta(\Omega_2+1,\Omega),\Omega),0)}$
{1 {1 {1 2 } 1 {1 {1 {1 2 } 1 {1 {1 {1 2 } 2} 2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2+\theta(\Omega_2+\theta(\Omega_2+\theta(\Omega_2,\Omega),\Omega),\Omega),0)}$
{1 {1 {1 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_22,0)}$
{1 {1 {1 2 } 1 {1 2 } 2} 12} has recursion level ${\theta(\Omega_22+1,0)}$
{1 {1 {1 2 } 1 {1 2 } 2} 1 {1 {1 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_22,\Omega),0)}$
{1 {2 {1 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_22+\omega^{\theta(\Omega_22,\Omega)+1},0)}$
{1 {1 {1 2 } 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_2,\theta(\Omega_22,\Omega)+1),0)}$
{1 {1 {1 2 } 1 {1 {1 2 } 1 {1 2 } 2} 2 {1 2 } 2} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_2+\theta(\Omega_22,\Omega),\Omega+1),0)}$
{1 {1 {1 2 } 1 {1 2 } 3} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_22,\Omega+1),0)}$
{1 {1 {1 2 } 1 {1 2 } 1 2} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_22+1,\Omega),0)}$
{1 {1 {1 2 } 1 {1 2 } 1 {1 {1 2} 2 } 2} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_22+\varepsilon_{\Omega+1},\Omega),0)}$
{1 {1 {1 2 } 1 {1 2 } 1 {1 {1 {1 2 } 1 {1 2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_22+\theta(\Omega_22+\theta(\Omega_22,\Omega),\Omega),0)}$
{1 {1 {1 2 } 1 {1 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_23,0)}$
{1 {1 {1 2 } 1 {1 2 } 1 {1 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_24,0)}$
{1 {1 {2 2 } 2} 2} has recursion level ${\theta(\Omega_2\omega,0)}$
{1 {1 {12 2 } 2} 2} has recursion level ${\theta(\Omega_2\Omega,0)}$
{1 {1 {1 {1 2} 2 2 } 2} 2} has recursion level ${\theta(\Omega_2\varepsilon_{\Omega+1},0)}$
{1 {1 {1 {1 {2 2 } 2} 2 2 } 2} 2} has recursion level ${\theta(\Omega_2\theta(\Omega_2\omega,\Omega),0)}$
{1 {1 {1 {1 {1 {1 {2 2 } 2} 2 2 } 2} 2 2 } 2} 2} has recursion level ${\theta(\Omega_2\theta(\Omega_2\theta(\Omega_2\omega,\Omega),\Omega),0)}$
{1 {1 {1 3 } 2} 2} has recursion level ${\theta(\Omega_2^2,0)}$
{1 {1 {1 4 } 2} 2} has recursion level ${\theta(\Omega_2^3,0)}$
{1 {1 {1 1,2 } 2} 2} has recursion level ${\theta(\Omega_2^\omega,0)}$
{1 {1 {1 12 } 2} 2} has recursion level ${\theta(\Omega_2^\Omega,0)}$
{1 {1 {1 1 {1 {1 12 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\theta(\Omega_2^\Omega,\Omega)},0)}$
{1 {1 {1 1 {1 {1 1 {1 {1 12 } 2} 2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\theta(\Omega_2^{\theta(\Omega_2^\Omega,\Omega)},\Omega)},0)}$
{1 {1 {1 1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2},0)}$
{1 {1 {1 1 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2}+\Omega_2,0)}$
{1 {1 {1 1 2 } 1 {1 1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2}2,0)}$
{1 {1 {2 1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2}\omega,0)}$
{1 {1 {1 2 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2+1},0)}$
{1 {1 {1 1 3 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_22},0)}$
{1 {1 {1 1 1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^2},0)}$
{1 {1 {1 {2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^\omega},0)}$
{1 {1 {1 {12 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^\Omega},0)}$
{1 {1 {1 {1 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2}},0)}$
{1 {1 {1 {1 2 } 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2}}+\Omega_2,0)}$
{1 {1 {1 {1 2 } 2 } 1 {1 {1 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2}}2,0)}$
{1 {1 {2 {1 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2}}\omega,0)}$
{1 {1 {1 2 {1 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2}+1},0)}$
{1 {1 {1 {1 2 } 3 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2}2},0)}$
{1 {1 {1 {1 2 } 1 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2+1}},0)}$
{1 {1 {1 {1 2 } 1 {1 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_22}},0)}$
{1 {1 {1 {2 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2\omega}},0)}$
{1 {1 {1 {1 3 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2^2}},0)}$
{1 {1 {1 {1 1 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2^{\Omega_2}}},0)}$
{1 {1 {1 {1 {1 1 2 } 2 } 2 } 2} 2} has recursion level ${\theta(\Omega_2^{\Omega_2^{\Omega_2^{\Omega_2^{\Omega_2^{\Omega_2}}}}},0)}$
{1 {1 {1  2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2+1},0)}$
{1 {1 {1  2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2+1}+\Omega_2,0)}$
{1 {1 {1  2 } 1 {1  2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2+1}2,0)}$
{1 {1 {2  2 } 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega_2+1}+1},0)}$
{1 {1 {1 {1  2 } 2  2 } 2} 2} has recursion level ${\theta(\omega^{\varepsilon_{\Omega_2+1}2},0)}$
{1 {1 {1 {1  2 } 1 {1  2 } 2  2 } 2} 2} has recursion level ${\theta(\omega^{\omega^{\varepsilon_{\Omega_2+1}2}},0)}$
{1 {1 {1 {2  2 } 2  2 } 2} 2} has recursion level ${\theta(\omega^{\omega^{\omega^{\varepsilon_{\Omega_2+1}+1}}},0)}$
{1 {1 {1 {1 {1  2 } 2  2 } 2  2 } 2} 2} has recursion level ${\theta(\omega^{\omega^{\omega^{\varepsilon_{\Omega_2+1}2}}},0)}$
{1 {1 {1  3 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2+2},0)}$
{1 {1 {1  1 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_22},0)}$
{1 {1 {1  1 3 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_23},0)}$
{1 {1 {1  1 1 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2^2},0)}$
{1 {1 {1  1 {1 2 } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2^{\Omega_2}},0)}$
{1 {1 {1  1 {1 {1 2 } 2 } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_2^{\Omega_2^{\Omega_2^{\Omega_2}}}},0)}$
{1 {1 {1  1 {1  2 } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\Omega+1}},0)}$
{1 {1 {1  1 {1  1 {1  2 } 2 } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\varepsilon_{\varepsilon_{\Omega+1}}},0)}$
{1 {1 {1  1  2 } 2} 2} has recursion level ${\theta(\theta(2,\Omega_2),0)}$
{1 {1 {1  1  1  2 } 2} 2} has recursion level ${\theta(\theta(3,\Omega_2),0)}$
{1 {1 {1 {2  } 2 } 2} 2} has recursion level ${\theta(\theta(\omega,\Omega_2),0)}$
{1 {1 {1 {12  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega,\Omega_2),0)}$
{1 {1 {1 {1 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_2,\Omega_2),0)}$
{1 {1 {1 {1 2  } 3 } 2} 2} has recursion level ${\theta(\theta(\Omega_2,\Omega_2+1),0)}$
{1 {1 {1 {1 2  } 1  2 } 2} 2} has recursion level ${\theta(\theta(\Omega_2+1,\Omega_2),0)}$
{1 {1 {1 {1 2  } 1 {1 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_22,\Omega_2),0)}$
{1 {1 {1 {2 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_2\omega,\Omega_2),0)}$
{1 {1 {1 {1 3  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_2^2,\Omega_2),0)}$
{1 {1 {1 {1 1 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_2^{\Omega_2},\Omega_2),0)}$
{1 {1 {1 {1 {1 2 } 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_2^{\Omega_2^{\Omega_2}},\Omega_2),0)}$
{1 {1 {1 {1 {1  2 } 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\varepsilon_{\Omega_2+1},\Omega_2),0)}$
{1 {1 {1 {1 {1 {2  } 2 } 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\theta(\omega,\Omega_2),\Omega_2),0)}$
{1 {1 {1 {1 {1 {1 {1 {2  } 2 } 2  } 2 } 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\theta(\theta(\omega,\Omega_2),\Omega_2),\Omega_2),0)}$
{1 {1 {1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3,0)}$
{1 {1 {1 {1  2  } 2 } 2} 3} has recursion level ${\theta(\Omega_3,1)}$
{1 {1 {1 {1  2  } 2 } 2} 12} has recursion level ${\theta(\Omega_3+1,0)}$
{1 {1 {1 {1  2  } 2 } 2} 1 {12} 2} has recursion level ${\theta(\Omega_3+\Omega,0)}$
{1 {1 {1 {1  2  } 2 } 2} 1 {1 {1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3,\Omega),0)}$
{1 {2 {1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\omega^{\theta(\Omega_3,\Omega)+1},0)}$
{1 {1 2 {1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\varepsilon_{\theta(\Omega_3,\Omega)+1},0)}$
{1 {1 {1 {1  2  } 2 } 3} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3,\Omega+1),0)}$
{1 {1 {1 {1  2  } 2 } 1 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3+1,\Omega),0)}$
{1 {1 {1 {1  2  } 2 } 1 {12 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3+\Omega,\Omega),0)}$
{1 {1 {1 {1  2  } 2 } 1 {1 {1 {1 {1  2  } 2 } 2} 2 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3+\theta(\Omega_3,\Omega),\Omega),0)}$
{1 {1 {1 {1  2  } 2 } 1 {1 2 } 2} 2} has recursion level ${\theta(\Omega_3+\Omega_2,0)}$
{1 {1 {1 {1  2  } 2 } 1 {1  2 } 2} 2} has recursion level ${\theta(\Omega_3+\varepsilon_{\Omega_2+1},0)}$
{1 {1 {1 {1  2  } 2 } 1 {1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3,\Omega_2),0)}$
{1 {1 {2 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\omega^{\theta(\Omega_3,\Omega_2)+1},0)}$
{1 {1 {1  2 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\varepsilon_{\theta(\Omega_3,\Omega_2)+1},0)}$
{1 {1 {1 {1  2  } 3 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3,\Omega_2+1),0)}$
{1 {1 {1 {1  2  } 1  2 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3+1,\Omega_2),0)}$
{1 {1 {1 {1  2  } 1 {1 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3+\Omega_2,\Omega_2),0)}$
{1 {1 {1 {1  2  } 1 {1 {1 {1  2  } 2 } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3+\theta(\Omega_3+\theta(\Omega_3,\Omega_2),\Omega_2),0)}$
{1 {1 {1 {1  2  } 1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_32,0)}$
{1 {1 {1 {1  2  } 1 {1  2  } 1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_33,0)}$
{1 {1 {1 {2  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3\omega,0)}$
{1 {1 {1 {12  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3\Omega,0)}$
{1 {1 {1 {1 2  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3\Omega_2,0)}$
{1 {1 {1 {1  3  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^2,0)}$
{1 {1 {1 {1  4  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^3,0)}$
{1 {1 {1 {1  1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3},0)}$
{1 {1 {1 {1  1  2  } 1 {1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3}+\Omega_3,0)}$
{1 {1 {1 {1  1  2  } 1 {1  1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3}2,0)}$
{1 {1 {1 {2  1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3}\omega,0)}$
{1 {1 {1 {1  2  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3+1},0)}$
{1 {1 {1 {1  1  3  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_32},0)}$
{1 {1 {1 {1  1  1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^2},0)}$
{1 {1 {1 {1 {2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^\omega},0)}$
{1 {1 {1 {1 {1  2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3}},0)}$
{1 {1 {1 {2 {1  2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3}}\omega,0)}$
{1 {1 {1 {1  2 {1  2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3}+1},0)}$
{1 {1 {1 {1 {1  2  } 3  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3}2},0)}$
{1 {1 {1 {1 {1  2  } 1  2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3+1}},0)}$
{1 {1 {1 {1 {1  2  } 1 {1  2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_32}},0)}$
{1 {1 {1 {1 {2  2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3\omega}},0)}$
{1 {1 {1 {1 {1  3  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3^2}},0)}$
{1 {1 {1 {1 {1  1  2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3^{\Omega_3}}},0)}$
{1 {1 {1 {1 {1 {1  1  2  } 2  } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_3^{\Omega_3^{\Omega_3^{\Omega_3^{\Omega_3^{\Omega_3}}}}},0)}$
{1 {1 {1 {1   2  } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_3+1},0)}$
{1 {1 {1 {1   3  } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_3+2},0)}$
{1 {1 {1 {1   1   2  } 2 } 2} 2} has recursion level ${\theta(\theta(2,\Omega_3),0)}$
{1 {1 {1 {1 {2   } 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\omega,\Omega_3),0)}$
{1 {1 {1 {1 {1  2   } 2  } 2 } 2} 2} has recursion level ${\theta(\theta(\Omega_3,\Omega_3),0)}$
{1 {1 {1 {1 {1   2   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_4,0)}$
{1 {1 {1 {1 {1   2   } 1 {1   2   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_42,0)}$
{1 {1 {1 {1 {2   2   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_4\omega,0)}$
{1 {1 {1 {1 {1   3   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_4^2,0)}$
{1 {1 {1 {1 {1   1   2   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_4^{\Omega_4},0)}$
{1 {1 {1 {1 {1 {1   2   } 2   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_4^{\Omega_4^{\Omega_4}},0)}$
{1 {1 {1 {1 {1 {1   1   2   } 2   } 2  } 2 } 2} 2} has recursion level ${\theta(\Omega_4^{\Omega_4^{\Omega_4^{\Omega_4}}},0)}$
{1 {1 {1 {1 {1    2   } 2  } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_4+1},0)}$
{1 {1 {1 {1 {1 {1     2    } 2   } 2  } 2 } 2} 2} has recursion level ${\theta(\varepsilon_{\Omega_5+1},0)}$

# Complete definition

Separators such as {1 {1 {1 {1 {1 {1     2    } 2   } 2  } 2 } 2} 2} look very complex, but we can simplify it by changing the process a little. Here’s the complete ruleset of mEAN.

First, let separators without any grave accents at the left-superscript position of the rbrace have GA-value 0, and separators with m grave accents at the left-superscript position of the rbrace have GA-value m+1 (note that the m-ple grave accent also has GA-value m).

## Rule and process

• Rule 1: (base rule – only 2 entries) s(a,b) = a^b
• Rule 2: (recursion rule – neither the 2nd nor 3rd entry is 1) s(a,b,c #) = s(a, s(a,b-1,c #) ,c-1 #)
• Rule 3: (tailing rule – the last entry is 1) s(# A 1) = s(#), {# A 1} = {#}, and {# A 1 …} = {# …}
• Rule 4: (if lv(A) < lv(B)) {# A 1 B #′} = {# B #′}

where # is a string of entries and separators, it can also be empty. A and B are separators.

If none of the 4 rules above applies, start the process shown below. Note that case B1, B2 and B4 are terminal but case A and B3 are not. And note that b, n, m, M, Bt and K are parts of the original array but t, i, Si, At, P and Q are not. First start from the 3rd entry.

• Case A: If the entry is 1, then you jump to the next entry.
• Case B: If the entry n is not 1, look to your left:
• Case B1: If the comma is immediately before you, then
1. Change the “1,n” into “b,n-1” where n is this non-1 entry and the b is the iterator.
2. Change all the entries at base layer before them into the base.
3. The process ends.
• Case B2: If the m-ple grave accent M (M =  … or {1 …} with m grave accents) is immediately before you, then
1. Change the “M n” into “M 2 M n-1”.
2. Let t be such that the M is at layer t. And Let separator At = Bt = M.
3. Repeat this:
1. Subtract t by 1.
2. Let separator Bt be such that it’s at layer t, and M is inside it.
3. If t = 1, then break the repeating, or else continue repeating.
4. Find the maximum of t such that At has GA-value lessequal to m-1.
5. If At has GA-value m-1, then
1. Let string P and Q be such that Bt = “P M Q”.
2. Change Bt into Sb, where b is the iterator, S1 is comma, and Si+1 = “P 1 Si 2 Q”.
3. The process ends.
6. If At has GA-value less than m-1, then
1. Let string P and Q be such that Bt = “P Bt+1 Q”.
2. Change Bt into “P {1 At+1 2 …} Q” with m-1 grave accents at the left-superscript position of the rbrace.
3. The process ends.
• Case B3: If a separator K that is neither comma nor grave accent is immediately before you, then
1. Change the “K n” into “K 2 K n-1”.
2. Set separator At = K, here K is at layer t.
3. Jump to the first entry of the former K.
• Case B4: If an lbrace is immediately before you, then
1. Change separator {n #} into string Sb, where b is the iterator, S1 = “{n-1 #}” and Si+1 = “Si 1 {n-1 #}”.
2. The process ends.

## Level comparison

First, all arrays have the lowest and the same level. And note that the same separators have the same level. To compare levels of other separators A and B, we follow these steps.

1. Apply rule 3 to A and B until rule 3 cannot apply any more.
2. If GA-value of A < GA-value of B, then lv(A) < lv(B); if GA-value of A > GA-value of B, then lv(A) > lv(B); or else –
3. Let A = {a1A1a2A2…ak-1Ak-1ak…} and B = {b1B1b2B2…bl-1Bl-1bl…}
4. If k = 1 and l > 1, then lv(A) < lv(B); if k > 1 and l = 1, then lv(A) > lv(B); if k = l = 1, follow step 5; if k > 1 and l > 1, follow step 6 ~ 11
5. If a1 < b1, then lv(A) < lv(B); if a1 > b1, then lv(A) > lv(B); if a1 = b1, then lv(A) = lv(B)
6. Let ${M(A)=\{i\in\{1,2,\cdots,k-1\}|\forall j\in\{1,2,\cdots,k-1\}(lv(A_i)\ge lv(A_j))\}}$, and ${M(B)=\{i\in\{1,2,\cdots,l-1\}|\forall j\in\{1,2,\cdots,l-1\}(lv(B_i)\ge lv(B_j))\}}$.
7. If lv(AmaxM(A)) < lv(BmaxM(B)), then lv(A) < lv(B); if lv(AmaxM(A)) > lv(BmaxM(B)), then lv(A) > lv(B); or else –
8. If |M(A)| < |M(B)|, then lv(A) < lv(B); if |M(A)| > |M(B)|, then lv(A) > lv(B); or else –
9. Let A = {#1 AmaxM(A) #2} and B = {#3 BmaxM(B) #4}
10. If lv({#2}) < lv({#4}), then lv(A) < lv(B); if lv({#2}) > lv({#4}), then lv(A) > lv(B); or else –
11. If lv({#1}) < lv({#3}), then lv(A) < lv(B); if lv({#1}) > lv({#3}), then lv(A) > lv(B); if lv({#1}) = lv({#3}), then lv(A) = lv(B)

## Explanation

The step 4, 5 and 6 of case B2 allow us to use separators like {1     2} in EAN. For example, s(a,b {1 {1  3  } 3} 2) changes into s(a,b {1 {1  3  } 2 {1  3  } 2} 2) until we meet case B2, by step 1 it becomes s(a,b {1 {1  2  2  } 2 {1  3  } 2} 2), and in step 4 At = A1 = {1 {1  3  } 3} has GA-value 0 (less than 2), so we jump into step 6, so s(a,b {1 {1  3  } 3} 2) = s(a,b {1 {1 {1  3  } 2 } 2 {1  3  } 2} 2). The next time we start the process, in step 4 of case B2, At will be A2 = {1 {1  3  } 2 } (has GA-value 2), so we jump to step 5, so s(a,b {1 {1 {1  3  } 2 } 2 {1  3  } 2} 2) = s(a,b {1 {1 {1 …{1 {1 {1 {1,2  2  } 2 } 2  2  } 2 }… 2  2  } 2 } 2 {1 {1  3  } 2 } 1 {1  3  } 2} 2) with b-1 2  2  } 2 }′s.

Before this change, an m-ple grave accent needs to be inside a separator with GA-value = m-1, and this GA-value = m-1 separator needs to be inside a separator with GA-value = m-2, and so on. But now, a separator with GA-value = 0 is enough. And {1     2} still have similar strength to {1 {1 {1 {1 {1 {1     2    } 2   } 2  } 2 } 2} 2}.

## Comparison

Let f(n) = s(n,n {1 …2} 2) with an n-ple grave accent, then f(n) eventually outgrows all expressions in mEAN, so it has growth rate ${\theta(\Omega_\omega,0)}$. That’s the limit of mEAN, also eventually outgrows any function provable recursive in ${\Pi_1^1}$ comprehension (${\Pi_1^1-CA_0}$) and the theory of finitely iterated inductive definitions (${ID_{<\omega}}$). It has similar growth rate to U(n) function in BAN, and it’s a lower bound for growth rate of subcubic graph number (SCG(n)) and simple subcubic graph number (SSCG(n)).

Advertisements