Googology Wiki
Advertisement
Googology Wiki

This has been corrected for new definitions. This post will look at extended hyperfactorial array notation. It is simply definied as [k@1[k+11]@2] = [k@1[k@1[k...[k@1[k@1@2]...]@2]@2] with n nests.  This is surprisingly powerful. As a small sub rule, if the type-k brackets don't exist, put them in around the type-k+1. This was designed to reach the TFB ordinal, and the type-k brackets work in pretty much the same way to \(\Omega_k\). In the following comparisons I have put the type-k brackets in the second row just to kick start it a bit. Quite a lot of the evaluation relies on the type-k brackets doing to \(\Omega_k\) exactly as type-1 brackets do to \(\omega\). See the type-1 bracket comparisons here and here.

One thing I have noticed lately which is technically a mistake in my definitions is that in my notation, \(\Gamma_1\) should be [1]w/[1]w/[1]w/....w/[1]w/[2(1)2]. In my notation, the Gamma 1 equivalent, [1(1)3], is actually [1(1)2]w/[1(1)2]w/...w/[1(1)2], and therefore strangely enough, the mistake was actually that my notation is more powerful than expected!

If unspecified, assume a ... means omega+1 (+1 just so it's not a limit ordinal) repeats.

Type-2 brackets[]

Hyperfactorial array (without the n!) FGH ordinal
[1(1)2]
[1(1)k] (is actually greater than (see 2nd paragraph at top))
[1(1)[1(1)2]]
[1(1)[21]] = [1(1)[1(1)[1(1)[...[1(1)n]...]]]]
[1(1)[21]]w/[1] = [1,1,...,1,2(1)[21]]
[1(1)[22]] = [1(1)[21]]w/[1(1)[21]]w/...w/[1(1)[21]] > [1]w/[1]w/[1]w/....w/[1]w/[2(1)[21]] = next Gamma after [1(1)[21]]
[1(1)[2k]] = [1(1)[2k-1]]w/[1(1)[2k-1]]w/...w/[1(1)[2k-1]] > [1]w/[1]w/[1]w/....w/[1]w/[2(1)[2k-1]] = next Gamma after [1(1)[2k-1]]
[1(1)[21,2]] = [1(1)[2[21]]]
[1(1)[22,2]] > [1]w/[1]w/[1]w/....w/[1]w/[2(1)[21,2]] = next Gamma after [1(1)[21,2]]
[1(1)[2k,2]] > [1]w/[1]w/[1]w/....w/[1]w/[2(1)[2k-1,2]] = next Gamma after [1(1)[2k-1,2]]
[1(1)[21,3]] = [1(1)[2[21],2]]
[1(1)[21,4]] = [1(1)[2[21],3]]
[1(1)[21,k]] = [1(1)[2[21],k-1]]
[1(1)[21,1,2]] = [1(1)[21,[21]]]
[1(1)[2k,1,2]] = (k-1)th gamma after [1(1)[21,1,2]]
[1(1)[21,2,2]] = [1(1)[2[21,1,2],1,2]]
[1(1)[21,k,2]] = [1(1)[2[21,1,2],k-1,2]]
[1(1)[21,1,3]] = [1(1)[21,[21],2]]
[1(1)[21,1,4]] = [1(1)[21,[21],3]]
[1(1)[21,1,k]] = [1(1)[21,[21],k-1]]
[1(1)[2a,b,c]]
[1(1)[21,1,1,2]] = [1(1)[21,1,[21]]
[1(1)[2k,1,1,2]] = (k-1)th gamma after [1(1)[21,1,1,2]]
[1(1)[2[21],1,1,2]]
[1(1)[21,2,1,2]] = [1(1)[2[21,1,1,2],1,1,2]]
[1(1)[21,3,1,2]] = [1(1)[2[21,1,1,2],2,1,2]]
[1(1)[21,k,1,2]] = [1(1)[2[21,1,1,2],k-1,1,2]]
[1(1)[21,[21],1,2]]
[1(1)[21,[22],1,2]] = [1(1)[2[21,[21],1,2],[21],1,2]]
[1(1)[21,[2k],1,2]] = [1(1)[2[21,[21],1,2],[2k-1],1,2]]
[1(1)[21,[21,2],1,2]] = [1(1)[21,[2[21]],1,2]]
[1(1)[21,[22,2],1,2]] = [1(1)[2[21,[21,2],1,2],[21,2],1,2]]
[1(1)[21,[21,3],1,2]] = [1(1)[21,[2[21],2],1,2]]
[1(1)[21,[21,k],1,2]] = [1(1)[21,[2[21],k-1],1,2]]
[1(1)[21,[21,1,2],1,2]] = [1(1)[21,[21,[21]]]
[1(1)[21,[2k,1,2],1,2]]
[1(1)[21,[2[21],1,2],1,2]]
[1(1)[21,[2[21,2],1,2],1,2]]
[1(1)[21,[2[21,k],1,2],1,2]]
[1(1)[21,[21,2,2],1,2]] = [1(1)[21,[2[21,1,2],1,2],1,2]]
[1(1)[21,[2[21],2,2],1,2]]
[1(1)[21,[2[21,2],2,2],1,2]]
[1(1)[21,[21,3,2],1,2]] = [1(1)[21,[2[21,1,2],2,2],1,2]]
[1(1)[21,[21,k,2],1,2]] = [1(1)[21,[2[21,1,2],k-1,2],1,2]]
[1(1)[21,[21,1,3],1,2]] = [1(1)[21,[21,[21],2],1,2]]
[1(1)[21,[2[21],1,3],1,2]]
[1(1)[21,[2[21,2],1,3],1,2]]
[1(1)[21,[2[21,1,2],1,3],1,2]] = [1(1)[21,[2[21,[21]],1,3],1,2]]
[1(1)[21,[2[21,2,2],1,3],1,2]] = [1(1)[21,[2[2[21,1,2],1,2],1,3],1,2]]
[1(1)[21,[2[21,k,2],1,3],1,2]] = [1(1)[21,[2[2[21,1,2],k-1,2],1,3],1,2]]
[1(1)[21,2,3],1,2]] = [1(1)[21,[2[21,1,3],1,3],1,2]]
[1(1)[21,k,3],1,2]] = [1(1)[21,[2[21,1,3],k-1,3],1,2]]
[1(1)[21,1,4],1,2]] = [1(1)[21,[21,[21],3],1,2]]
[1(1)[21,1,k],1,2]] = [1(1)[21,[21,[21],k-1],1,2]]
[1(1)[21,1,2,2]] = [1(1)[21,[21,1,1,2],1,2]]

It should be obvious by now that Omega brackets here work in exactly the same way as the ones here, with the only difference being that the brackets analysed by Cloudy176 (through the link) use lower case omega, and these upper case omega, I believe that the evidence from the examples above all exactly matching Cloudy's work (if they don't they probably should: point out anything that looks unusual), should be enough to just skip the rest of the analysis contained on the 1st analysis page, to save typing out pretty much the same thing exactly again and just take a few of the more important comparisons:

Continued Type-2 Brackets[]

Hyperfactorial array (without the n!) FGH ordinal
[1(1)[21,1,1,1,2]]
[1(1)[21,1,1,1,1,2]]
[1(1)[21(1)2]]
[1(1)[21(1)1(1)2]]
[1(1)[21([1])2]]

...Quite powerful then, but that's nothing compared to what can be done by putting type-3 brackets in type-2 brackets in type-1 brackets and so on. Type-3 brackets will work in exactly the same way as type-2 brackets except that they will nest type-2 brackets rather than type 1. Because the rules are exactly the same in every respect apart from this, there really is no point copying out the above comparisons again. (if you really want them, just look at the stuff above, and increase all the subscripts on brackets and Omegas by 1.

Up to \(\psi_0(\varepsilon_{\Omega_{\omega}+1})\): the TFB ordinal[]

Hyperfactorial array (without the n!) FGH ordinal
[1(1)[21(1)k]]
[1(1)[21(1)[21(1)2]]]
[1(1)[21(1)[31]]]
[1(1)[21(1)[31,1,2]]]
[1(1)[21(1)[31,1,1,1,2]]]
[1(1)[21(1)[31(1)2]]]
[1(1)[21(1)[31([1])2]]]
[1(1)[21(1)[31(1)[41(1)2]]]]
[1(1)[[1]1([1])2]]

All the full definitions (going to be at some point: they still need a little work) are on my website here (including fixed ones mentioned in the comments in the last post).

Advertisement