+ω法序数超运算分析:修订间差异
更多操作
小 →预期强度: 更正 |
小 更正错误 |
||
| (未显示同一用户的2个中间版本) | |||
| 第1行: | 第1行: | ||
+ | +ω法序数超运算是一种[[序数超运算]]型[[序数记号]],作者是量子杰克,与+1法超运算类似,但区别是遇到[[不动点]]会+ω而不是+1,原因是根据分析,这样能给出更整的基本列。序数超运算可以进行许多更高级别的拓展。 | ||
== 定义 == | == 定义 == | ||
一个序数超运算的格式必须是<math>\beta\{\lambda\}\alpha</math>,其中β,λ,α都是正序数。 | 一个序数超运算的格式必须是<math>\beta\{\lambda\}\alpha</math>,其中β,λ,α都是正序数。 | ||
在标准表达式中:底数β只能是正整数或超限基数。若底数是超限基数,只能是<math>\Omega_x</math>,其中x是序数。定义:<math>\Omega_0=\omega</math>,对于正序数x,<math>\Omega_x</math>为第x个不可数基数(不是可数非递归序数,因为在超运算型记号中,不可数与可数非递归的效果存在本质区别)。 | |||
若底数有限,则指数α必须有限。若底数为超限基数,则指数的势必须小于等于底数的势。例如,若底数为ω,指数必须可数。若底数为<math>\Omega_x</math>,指数必须小于<math>\Omega_{x+1}</math>。 | 若底数有限,则指数α必须有限。若底数为超限基数,则指数的势必须小于等于底数的势。例如,若底数为ω,指数必须可数。若底数为<math>\Omega_x</math>,指数必须小于<math>\Omega_{x+1}</math>。 | ||
| 第27行: | 第27行: | ||
定义:<math>\lambda_1=\lambda</math>;<math>\lambda_n</math>(n为大于1的正整数)= 将<math>\lambda_{n-1}</math>的表达式中所有x>0的<math>\Omega_x</math>全部替换为<math>\Omega_{x+y}</math>。若指数有限,β{λ}α = Ω_x{λ[Ω_(x+y+1)]}d;β{λ}1 = Ω_x{λ[Ω_(x+y)]}ω;β{λ}(n+1) = 将β{λ}n表达式中的λ_n[Ω_(x+y*n)]替换为λ_n[Ω_(x+y*n)]{λ_(n+1)[Ω_(x+y*(n+1))]}ω。若指数为超限后继序数,β{λ}α = Ω_x{λ[Ω_(x+y+1)]}(ω*c+d);β{λ}(ω*c+1) = Ω_x{λ[Ω_(x+y)]}j(β{λ}(ω*c));β{λ}(ω*c+n+1) = 将β{λ}n表达式中的λ_n[Ω_(x+y*n)]替换为λ_n[Ω_(x+y*n)]{λ_(n+1)[Ω_(x+y*(n+1))]}ω;若指数为极限序数,β{λ}α = lim(β{λ}(α[n]))。 | 定义:<math>\lambda_1=\lambda</math>;<math>\lambda_n</math>(n为大于1的正整数)= 将<math>\lambda_{n-1}</math>的表达式中所有x>0的<math>\Omega_x</math>全部替换为<math>\Omega_{x+y}</math>。若指数有限,β{λ}α = Ω_x{λ[Ω_(x+y+1)]}d;β{λ}1 = Ω_x{λ[Ω_(x+y)]}ω;β{λ}(n+1) = 将β{λ}n表达式中的λ_n[Ω_(x+y*n)]替换为λ_n[Ω_(x+y*n)]{λ_(n+1)[Ω_(x+y*(n+1))]}ω。若指数为超限后继序数,β{λ}α = Ω_x{λ[Ω_(x+y+1)]}(ω*c+d);β{λ}(ω*c+1) = Ω_x{λ[Ω_(x+y)]}j(β{λ}(ω*c));β{λ}(ω*c+n+1) = 将β{λ}n表达式中的λ_n[Ω_(x+y*n)]替换为λ_n[Ω_(x+y*n)]{λ_(n+1)[Ω_(x+y*(n+1))]}ω;若指数为极限序数,β{λ}α = lim(β{λ}(α[n]))。 | ||
== 重要性质 == | |||
序数超运算表达式<math>\beta\{\lambda\}\alpha</math>的值满足: | |||
若底数与指数均有限,则表达式的值仍有限。 | |||
<math>\forall\{\alpha,\beta\}\subseteq N, \ \beta\{\lambda\}\alpha\in N</math> | |||
若底数为超限序数,指数的势小于等于底数的势,则表达式的值的势仍等于底数的势。例如,若底数为ω,指数可数,则表达式的值仍可数。若底数为<math>\Omega_x</math>,指数小于<math>\Omega_{x+1}</math>,则表达式的值介于<math>\Omega_x</math>与<math>\Omega_{x+1}</math>之间。 | |||
<math>\forall\{\alpha,\beta\},\ Card(\beta)\geq max(Card(\alpha),\omega),\ Card(\beta\{\lambda\}\alpha)=Card(\beta)</math> | |||
若指数为超限序数,且指数的势大于底数的势,则表达式一定不标准,而且其值的势等于指数的势。尤其是,若指数为超限基数,且指数的势大于底数的势,则表达式的值等于指数。 | |||
<math>\forall\{\alpha,\beta\},\ Card(\alpha)>max(Card(\beta),\omega),\ Card(\beta\{\lambda\}\alpha)=Card(\alpha)</math> | |||
<math>\forall\{\alpha,\beta\},\ \alpha=Card(\alpha)>max(Card(\beta),\omega),\ \beta\{\lambda\}\alpha=\alpha</math> | |||
当底数为1时,表达式的值永远为1。当底数与指数均为2时,表达式的值永远为4。 | |||
<math>\forall\{\alpha,\lambda\}\subseteq Ord, \ 1\{\lambda\}\alpha=1,\ 2\{\lambda\}2=4</math> | |||
当底数与指数同为有限数n时,给定算符序数,可得一有限大数函数,其增长率相当于[[FGH]]的(1+算符序数)。 | |||
<math>n\{\lambda\}n\approx f_{1+\lambda}(n)</math> | |||
== 分析1 == | == 分析1 == | ||
| 第697行: | 第722行: | ||
!序数超运算 | !序数超运算 | ||
!BMS | !BMS | ||
|- | |||
|<math>\omega\{\Omega_2\}(\omega+1)=\omega\{\Omega\}(\omega\{\Omega_2\}\omega+\omega)</math> | |||
|(0)(1,1,1)(1,1)(2,1)(3,1) | |||
|- | |||
|<math>\omega\{\Omega_2\}(\omega+2)=\omega\{\Omega\{\Omega_2\}\omega\}(\omega\{\Omega_2\}\omega+\omega)</math> | |||
|(0)(1,1,1)(1,1)(2,2)(3,2)(4,2) | |||
|- | |- | ||
|<math>\omega\{\Omega_2\}\omega2</math> | |<math>\omega\{\Omega_2\}\omega2</math> | ||
|(0)(1,1,1)(1,1)(2,2,1) | |(0)(1,1,1)(1,1)(2,2,1) | ||
|- | |||
|<math>\omega\{\Omega_2\}\omega^2</math> | |||
|(0)(1,1,1)(1,1)(2,2,1)(2) | |||
|- | |- | ||
|<math>\omega\{\Omega_2+1\}\omega</math> | |<math>\omega\{\Omega_2+1\}\omega</math> | ||
| 第715行: | 第749行: | ||
|<math>\omega\{\Omega_22\}\omega</math> | |<math>\omega\{\Omega_22\}\omega</math> | ||
|(0)(1,1,1)(1,1,1) | |(0)(1,1,1)(1,1,1) | ||
|- | |||
|<math>\omega\{\Omega_2\omega\}\omega</math> | |||
|(0)(1,1,1)(2) | |||
|- | |- | ||
|<math>\omega\{\Omega_2\Omega\}\omega</math> | |<math>\omega\{\Omega_2\Omega\}\omega</math> | ||
| 第730行: | 第767行: | ||
|<math>\omega\{\Omega_2^2\}\omega</math> | |<math>\omega\{\Omega_2^2\}\omega</math> | ||
|(0)(1,1,1)(2,1,1) | |(0)(1,1,1)(2,1,1) | ||
|- | |||
|<math>\omega\{\Omega_2^\omega\}\omega</math> | |||
|(0)(1,1,1)(2,1,1)(3) | |||
|- | |- | ||
|<math>\omega\{\Omega_2^\Omega\}\omega</math> | |<math>\omega\{\Omega_2^\Omega\}\omega</math> | ||
| 第742行: | 第782行: | ||
|<math>\omega\{\Omega_2^{\Omega_2}\}\omega</math> | |<math>\omega\{\Omega_2^{\Omega_2}\}\omega</math> | ||
|(0)(1,1,1)(2,1,1)(3,1,1) = [[SIO]] | |(0)(1,1,1)(2,1,1)(3,1,1) = [[SIO]] | ||
|- | |||
|<math>\omega\{\Omega_2^{\Omega_2\times\Omega\uparrow\uparrow\omega}\}\omega</math> | |||
|(0)(1,1,1)(2,1,1)(3,1,1)(3,1)(4,2) = [[SRO]] | |||
|- | |- | ||
|<math>\omega\{\Omega_2^{\Omega_2^2}\}\omega</math> | |<math>\omega\{\Omega_2^{\Omega_2^2}\}\omega</math> | ||
| 第790行: | 第833行: | ||
|<math>\omega\{\Omega_{\Omega_2}\}\omega</math> | |<math>\omega\{\Omega_{\Omega_2}\}\omega</math> | ||
|(0)(1,1,1)(2,2,1)(3,1,1) | |(0)(1,1,1)(2,2,1)(3,1,1) | ||
|- | |||
|<math>\omega\{\Omega_{\Omega_\omega}\}\omega</math> | |||
|(0)(1,1,1)(2,2,1)(3,1,1)(4,2,1)(5) | |||
|- | |- | ||
|<math>\omega\{\Phi(1,0)\}\omega</math> | |<math>\omega\{\Phi(1,0)\}\omega</math> | ||
| 第798行: | 第844行: | ||
|- | |- | ||
|<math>\omega\{\Phi(1,1)\}\omega</math> | |<math>\omega\{\Phi(1,1)\}\omega</math> | ||
|(0)(1,1,1)(2,2,1)(3,2)(3,2) | |(0)(1,1,1)(2,2,1)(3,2)(2,2,1)(3,2) | ||
|- | |- | ||
|<math>\omega\{\Phi(2,0)\}\omega</math> | |<math>\omega\{\Phi(2,0)\}\omega</math> | ||
|(0)(1,1,1)(2,2,1)(3,2)( | |(0)(1,1,1)(2,2,1)(3,2)(3,2) | ||
|- | |- | ||
|<math>\omega\{\Phi(1,0,0)\}\omega</math> | |<math>\omega\{\Phi(1,0,0)\}\omega</math> | ||
|(0)(1,1,1)(2,2,1)(3,2)(4 | |(0)(1,1,1)(2,2,1)(3,2)(4,2) | ||
|- | |- | ||
|<math>\omega\{\psi_I(\Omega_{I+1})\}\omega</math> | |<math>\omega\{\psi_I(\Omega_{I+1})\}\omega</math> | ||
2026年5月31日 (日) 14:49的最新版本
+ω法序数超运算是一种序数超运算型序数记号,作者是量子杰克,与+1法超运算类似,但区别是遇到不动点会+ω而不是+1,原因是根据分析,这样能给出更整的基本列。序数超运算可以进行许多更高级别的拓展。
定义
一个序数超运算的格式必须是,其中β,λ,α都是正序数。
在标准表达式中:底数β只能是正整数或超限基数。若底数是超限基数,只能是,其中x是序数。定义:,对于正序数x,为第x个不可数基数(不是可数非递归序数,因为在超运算型记号中,不可数与可数非递归的效果存在本质区别)。
若底数有限,则指数α必须有限。若底数为超限基数,则指数的势必须小于等于底数的势。例如,若底数为ω,指数必须可数。若底数为,指数必须小于。
算符序数λ的势在目前版本中最多允许比底数多不超过I(首个不可达基数)。.
计算规则:
若指数为1,则值为底数。
若算符序数与指数均为后继序数,使用带跳不动点函数的简单迭代规则。
跳跃函数j(x)取,虽然可以取其他值,但根据分析,取x+ω能使基本列更整。
若指数为极限序数,值为对指数取基本列时得到的值的极限。。共尾性的极限序数的基本列长度为。
若指数为后继序数,算符序数为共尾性小于等于底数的极限序数:对于,将指数分解为一个的倍数与一个小于的序数之和,。若α<即c=0,则。若α>即c>0, 。
若指数为后继序数,算符序数为共尾性为底数的下一个超限基数:对于,展开为:。
若指数是后继序数,算符序数的共尾性大于底数的下一个超限基数,底数必须是超限基数(不能为有限数)。对于,y为正序数,将指数分为ω的倍数与自然数之和:。
定义:;(n为大于1的正整数)= 将的表达式中所有x>0的全部替换为。若指数有限,β{λ}α = Ω_x{λ[Ω_(x+y+1)]}d;β{λ}1 = Ω_x{λ[Ω_(x+y)]}ω;β{λ}(n+1) = 将β{λ}n表达式中的λ_n[Ω_(x+y*n)]替换为λ_n[Ω_(x+y*n)]{λ_(n+1)[Ω_(x+y*(n+1))]}ω。若指数为超限后继序数,β{λ}α = Ω_x{λ[Ω_(x+y+1)]}(ω*c+d);β{λ}(ω*c+1) = Ω_x{λ[Ω_(x+y)]}j(β{λ}(ω*c));β{λ}(ω*c+n+1) = 将β{λ}n表达式中的λ_n[Ω_(x+y*n)]替换为λ_n[Ω_(x+y*n)]{λ_(n+1)[Ω_(x+y*(n+1))]}ω;若指数为极限序数,β{λ}α = lim(β{λ}(α[n]))。
重要性质
序数超运算表达式的值满足:
若底数与指数均有限,则表达式的值仍有限。
若底数为超限序数,指数的势小于等于底数的势,则表达式的值的势仍等于底数的势。例如,若底数为ω,指数可数,则表达式的值仍可数。若底数为,指数小于,则表达式的值介于与之间。
若指数为超限序数,且指数的势大于底数的势,则表达式一定不标准,而且其值的势等于指数的势。尤其是,若指数为超限基数,且指数的势大于底数的势,则表达式的值等于指数。
当底数为1时,表达式的值永远为1。当底数与指数均为2时,表达式的值永远为4。
当底数与指数同为有限数n时,给定算符序数,可得一有限大数函数,其增长率相当于FGH的(1+算符序数)。
分析1
| 序数超运算 | BMS |
|---|---|
| (0)(1,1) = SCO | |
| (0)(1,1)(1)(2) | |
| (0)(1,1)(1)(2,1)(2)(3) | |
| (0)(1,1)(1)(2,1)(2)(3,1)(3)(4) | |
| (0)(1,1)(1,1) | |
| (0)(1,1)(1,1)(1)(2) | |
| (0)(1,1)(1,1)(1,1) | |
| (0)(1,1)(2) | |
| (0)(1,1)(2)(1,1) | |
| (0)(1,1)(2)(1,1)(2) | |
| (0)(1,1)(2)(2) | |
| (0)(1,1)(2)(3) | |
| (0)(1,1)(2)(3,1) | |
| (0)(1,1)(2)(3,1)(4)(5,1) | |
| (0)(1,1)(2,1) = CO | |
| (0)(1,1)(2,1)(1,1) | |
| (0)(1,1)(2,1)(1,1)(2)(3,1)(4,1)(3,1) | |
| (0)(1,1)(2,1)(1,1)(2,1) | |
| (0)(1,1)(2,1)(2) | |
| (0)(1,1)(2,1)(2)(3,1)(4,1) | |
| (0)(1,1)(2,1)(2,1) = LCO | |
| (0)(1,1)(2,1)(2,1)(1,1)(2,1) | |
| (0)(1,1)(2,1)(2,1)(1,1)(2,1)(2,1) | |
| (0)(1,1)(2,1)(2,1)(2,1) | |
| (0)(1,1)(2,1)(3) = HCO |
分析2
| 序数超运算 | BMS |
|---|---|
| (0)(1,1)(2,1)(3) = HCO | |
| (0)(1,1)(2,1)(3)(1)(2) | |
| (0)(1,1)(2,1)(3)(1,1) | |
| (0)(1,1)(2,1)(3)(1,1)(2,1) | |
| (0)(1,1)(2,1)(3)(1,1)(2,1)(3) | |
| (0)(1,1)(2,1)(3)(2) | |
| (0)(1,1)(2,1)(3)(2)(3,1)(4,1)(5) | |
| (0)(1,1)(2,1)(3)(2,1) | |
| (0)(1,1)(2,1)(3)(2,1)(2,1) | |
| (0)(1,1)(2,1)(3)(2,1)(3) | |
| (0)(1,1)(2,1)(3)(3) | |
| (0)(1,1)(2,1)(3)(4) | |
| (0)(1,1)(2,1)(3)(4,1) | |
| (0)(1,1)(2,1)(3)(4,1)(5,1)(6) | |
| (0)(1,1)(2,1)(3)(4,1)(5,1)(6)(7,1)(8,1)(9) | |
| (0)(1,1)(2,1)(3,1) = FSO |
分析3
| 序数超运算 | BMS |
|---|---|
| (0)(1,1)(2,1)(3,1) = FSO | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3) | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3)(4,1)(5,1)(6) | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3)(4,1)(5,1)(6,1) | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3)(4,1)(5,1)(6,1)(2,1) | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3)(4,1)(5,1)(6,1)(2,1)(3) | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3)(4,1)(5,1)(6,1)(4,1)(5,1)(6)(7,1)(8,1)(9,1)(5,1)(6) | |
| (0)(1,1)(2,1)(3,1)(1,1)(2,1)(3,1) | |
| (0)(1,1)(2,1)(3,1)(2) | |
| (0)(1,1)(2,1)(3,1)(2)(3,1)(4,1)(5,1) | |
| (0)(1,1)(2,1)(3,1)(2,1) | |
| (0)(1,1)(2,1)(3,1)(2,1)(2,1) | |
| (0)(1,1)(2,1)(3,1)(2,1)(3) | |
| (0)(1,1)(2,1)(3,1)(2,1)(3)(4,1)(5,1)(4,1)(5) | |
| (0)(1,1)(2,1)(3,1)(2,1)(3,1) | |
| (0)(1,1)(2,1)(3,1)(3) | |
| (0)(1,1)(2,1)(3,1)(3)(4,1)(5,1)(5) | |
| (0)(1,1)(2,1)(3,1)(3,1) = ACO | |
| (0)(1,1)(2,1)(3,1)(3,1)(2,1) | |
| (0)(1,1)(2,1)(3,1)(3,1)(2,1)(3,1)(3,1) | |
| (0)(1,1)(2,1)(3,1)(3,1)(3) | |
| (0)(1,1)(2,1)(3,1)(3,1)(3,1) | |
| (0)(1,1)(2,1)(3,1)(4) = SVO | |
| (0)(1,1)(2,1)(3,1)(4)(5,1)(6,1)(7,1)(8) | |
| (0)(1,1)(2,1)(3,1)(4,1) = LVO | |
| (0)(1,1)(2,1)(3,1)(4,1)(2,1) | |
| (0)(1,1)(2,1)(3,1)(4,1)(3,1) | |
| (0)(1,1)(2,1)(3,1)(4,1)(3,1)(4,1) | |
| (0)(1,1)(2,1)(3,1)(4,1)(4,1) | |
| (0)(1,1)(2,1)(3,1)(4,1)(5) | |
| (0)(1,1)(2,1)(3,1)(4,1)(5,1) | |
| (0)(1,1)(2,1)(3,1)(4,1)(5,1)(6,1) | |
| (0)(1,1)(2,2) = BHO |
分析4
| 序数超运算 | BMS |
|---|---|
| (0)(1,1)(2,2) = BHO | |
| (0)(1,1)(2,2)(1,1)(2,1)(3,1) | |
| (0)(1,1)(2,2)(1,1)(2,1)(3,1)(4,1) | |
| (0)(1,1)(2,2)(1,1)(2,2) | |
| (0)(1,1)(2,2)(2) | |
| (0)(1,1)(2,2)(2)(3,1)(4,2) | |
| (0)(1,1)(2,2)(2,1) | |
| (0)(1,1)(2,2)(2,1)(3,1) | |
| (0)(1,1)(2,2)(2,1)(3,2) | |
| (0)(1,1)(2,2)(2,1)(3,2)(3) | |
| (0)(1,1)(2,2)(2,1)(3,2)(3,1) | |
| (0)(1,1)(2,2)(2,1)(3,2)(3,1)(4) | |
| (0)(1,1)(2,2)(2,2) | |
| (0)(1,1)(2,2)(2,2)(2,2) | |
| (0)(1,1)(2,2)(3) | |
| (0)(1,1)(2,2)(3)(4,1)(5,2)(6) | |
| (0)(1,1)(2,2)(3,1) | |
| (0)(1,1)(2,2)(3,1)(2,2) | |
| (0)(1,1)(2,2)(3,1)(2,2)(3,1) | |
| (0)(1,1)(2,2)(3,1)(3,1) | |
| (0)(1,1)(2,2)(3,1)(4,2) | |
| (0)(1,1)(2,2)(3,1)(4,2)(5,1) | |
| (0)(1,1)(2,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(2,2) | |
| (0)(1,1)(2,2)(3,2)(2,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(3) | |
| (0)(1,1)(2,2)(3,2)(3,1) | |
| (0)(1,1)(2,2)(3,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(3,2)(3,1) | |
| (0)(1,1)(2,2)(3,2)(3,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(4) |
分析5
| 序数超运算 | BMS |
|---|---|
| (0)(1,1)(2,2)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4)(2,1)(3,2)(3)(4) | |
| (0)(1,1)(2,2)(3,2)(4)(2,2) | |
| (0)(1,1)(2,2)(3,2)(4)(2,2)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4)(3) | |
| (0)(1,1)(2,2)(3,2)(4)(3,1) | |
| (0)(1,1)(2,2)(3,2)(4)(3,2) | |
| (0)(1,1)(2,2)(3,2)(4)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4)(4) | |
| (0)(1,1)(2,2)(3,2)(4)(5,1) | |
| (0)(1,1)(2,2)(3,2)(4)(5,1)(6,2) | |
| (0)(1,1)(2,2)(3,2)(4)(5,1)(6,2)(7) | |
| (0)(1,1)(2,2)(3,2)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(2,1)(3,2)(3)(4) | |
| (0)(1,1)(2,2)(3,2)(4,1)(2,2) | |
| (0)(1,1)(2,2)(3,2)(4,1)(2,2)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4,1)(2,2)(3,2)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(3) | |
| (0)(1,1)(2,2)(3,2)(4,1)(3,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(3,1)(4,2)(5,3)(6,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(3,2) | |
| (0)(1,1)(2,2)(3,2)(4,1)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4,1)(3,2)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(4) | |
| (0)(1,1)(2,2)(3,2)(4,1)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(5,2) | |
| (0)(1,1)(2,2)(3,2)(4,1)(5,2)(6,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(5,2)(6,2) | |
| (0)(1,1)(2,2)(3,2)(4,1)(5,2)(6,2)(7) | |
| (0)(1,1)(2,2)(3,2)(4,1)(5,2)(6,2)(7,1) | |
| (0)(1,1)(2,2)(3,2)(4,1)(5,2)(6,2)(7,1)(8,2)(9,2)(10,1) | |
| (0)(1,1)(2,2)(3,2)(4,2) |
分析6
| 序数超运算 | BMS |
|---|---|
| (0)(1,1)(2,2)(3,2)(4,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,1)(3,2)(4,2)(5,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2)(3,2)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2)(3,2)(4,1)(5,2)(6,2)(7,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2)(3,2)(4,1)(5,2)(6,2)(7,2)(3,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2)(3,2)(4,1)(5,2)(6,2)(7,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2)(3,2)(4,1)(5,2)(6,2)(7,2)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4,2)(2,2)(3,2)(4,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,1)(4,2)(5,2)(6,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,1)(4,2)(5,2)(6,2)(7,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2)(3,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2)(4)(5,1)(6,2)(7,2)(6,2)(7) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2)(4,1)(5,2)(6,2)(7,2)(6,2)(7,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(3,2)(4,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(4) | |
| (0)(1,1)(2,2)(3,2)(4,2)(4,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(4,1)(5,2)(6,2)(7,2)(7,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(4,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(4,2)(4,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(5) | |
| (0)(1,1)(2,2)(3,2)(4,2)(5,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(5,1)(6,2)(7,2)(8,2)(9,1) | |
| (0)(1,1)(2,2)(3,2)(4,2)(5,2) | |
| (0)(1,1)(2,2)(3,2)(4,2)(5,2)(6,2) | |
| (0)(1,1)(2,2)(3,3) |
分析7
| 序数超运算 | BMS |
|---|---|
| (0)(1,1)(2,2)(3,3) | |
| (0)(1,1)(2,2)(3,3)(2,1) | |
| (0)(1,1)(2,2)(3,3)(2,1)(3,2)(4,3) | |
| (0)(1,1)(2,2)(3,3)(2,2) | |
| (0)(1,1)(2,2)(3,3)(2,2)(3,2) | |
| (0)(1,1)(2,2)(3,3)(2,2)(3,2)(4,2) | |
| (0)(1,1)(2,2)(3,3)(2,2)(3,3) | |
| (0)(1,1)(2,2)(3,3)(3) | |
| (0)(1,1)(2,2)(3,3)(3,1) | |
| (0)(1,1)(2,2)(3,3)(3,2) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,1) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,2) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,3) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,3)(5) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,3)(5,1) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,3)(5,2) | |
| (0)(1,1)(2,2)(3,3)(3,2)(4,3)(5,2)(6) | |
| (0)(1,1)(2,2)(3,3)(3,3) | |
| (0)(1,1)(2,2)(3,3)(4) | |
| (0)(1,1)(2,2)(3,3)(4,1) | |
| (0)(1,1)(2,2)(3,3)(4,2) | |
| (0)(1,1)(2,2)(3,3)(4,2)(5,3)(6,2) | |
| (0)(1,1)(2,2)(3,3)(4,3) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5,1) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5,2) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5,3) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5,3)(4,3)(5,3) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5,3)(5,3) | |
| (0)(1,1)(2,2)(3,3)(4,3)(5,3)(6,3) | |
| (0)(1,1)(2,2)(3,3)(4,4) | |
| (0)(1,1)(2,2)(3,3)(4,4)(5,4) | |
| (0)(1,1)(2,2)(3,3)(4,4)(5,4)(6,4) | |
| (0)(1,1)(2,2)(3,3)(4,4)(5,5) | |
| (0)(1,1,1) = BO |
预期强度
| 序数超运算 | BMS |
|---|---|
| (0)(1,1,1)(1,1)(2,1)(3,1) | |
| (0)(1,1,1)(1,1)(2,2)(3,2)(4,2) | |
| (0)(1,1,1)(1,1)(2,2,1) | |
| (0)(1,1,1)(1,1)(2,2,1)(2) | |
| (0)(1,1,1)(1,1)(2,2,1)(2,1) | |
| (0)(1,1,1)(1,1)(2,2,1)(2,1)(3,2,1)(3,1) | |
| (0)(1,1,1)(1,1)(2,2,1)(2,2) | |
| (0)(1,1,1)(1,1)(2,2,1)(2,2)(3,3,1) | |
| (0)(1,1,1)(1,1,1) | |
| (0)(1,1,1)(2) | |
| (0)(1,1,1)(2,1) | |
| (0)(1,1,1)(2,1)(1,1,1) | |
| (0)(1,1,1)(2,1)(3,2) = TFBO | |
| (0)(1,1,1)(2,1)(3,2,1) | |
| (0)(1,1,1)(2,1,1) | |
| (0)(1,1,1)(2,1,1)(3) | |
| (0)(1,1,1)(2,1,1)(3,1) = BIO | |
| (0)(1,1,1)(2,1,1)(3,1)(2) = EBO | |
| (0)(1,1,1)(2,1,1)(3,1)(4,2) = JO | |
| (0)(1,1,1)(2,1,1)(3,1,1) = SIO | |
| (0)(1,1,1)(2,1,1)(3,1,1)(3,1)(4,2) = SRO | |
| (0)(1,1,1)(2,1,1)(3,1,1)(3,1,1) = SMO | |
| (0)(1,1,1)(2,1,1)(3,1,1)(4,1)(5,2) = RO | |
| (0)(1,1,1)(2,1,1)(3,1,1)(4,1,1) = SKO | |
| (0)(1,1,1)(2,2) = SSO | |
| (0)(1,1,1)(2,2)(3,2) | |
| (0)(1,1,1)(2,2)(3,2)(4,1)(2) = LSO | |
| (0)(1,1,1)(2,2)(3,2)(4,1,1) = APO | |
| (0)(1,1,1)(2,2)(3,2)(4,2) | |
| (0)(1,1,1)(2,2)(3,3) | |
| (0)(1,1,1)(2,2)(3,3,1) | |
| (0)(1,1,1)(2,2,1) = BGO | |
| (0)(1,1,1)(2,2,1)(2,2) | |
| (0)(1,1,1)(2,2,1)(2,2,1) | |
| (0)(1,1,1)(2,2,1)(3) = SDO | |
| (0)(1,1,1)(2,2,1)(3,1) | |
| (0)(1,1,1)(2,2,1)(3,1,1) | |
| (0)(1,1,1)(2,2,1)(3,1,1)(4,2,1)(5) | |
| (0)(1,1,1)(2,2,1)(3,2) = LDO | |
| (0)(1,1,1)(2,2,1)(3,2)(2,2,1) | |
| (0)(1,1,1)(2,2,1)(3,2)(2,2,1)(3,2) | |
| (0)(1,1,1)(2,2,1)(3,2)(3,2) | |
| (0)(1,1,1)(2,2,1)(3,2)(4,2) | |
| (0)(1,1,1)(2,2,1)(3,2)(4,3) | |
| (0)(1,1,1)(2,2,1)(3,2)(4,3,1) | |
| (0)(1,1,1)(2,2,1)(3,2,1) | |
| (0)(1,1,1)(2,2,2) = pfec LRO |