User blog comment:Deedlit11/An ordinal version of Bowers' notation/@comment-25418284-20130313014604

Very nice.

One of the important properties of BEAF is its ability to bootstrap and describe itself. In ordinal-land, this would mean taking an ordinal like \(\{\omega, \omega (1) 2\}\) and using it as an index.

The prime block of \(\{\omega, \omega, 1, 2\}\) (say) would be something like \(\{\{\omega, n, 1, 2\}|n < p\}\). Of course, the primary issue is explaining what exactly it means when we plug an ordinal into a googological function.