User blog comment:Pellucidar12/Proof length function/@comment-1605058-20161226131313/@comment-29915175-20161228195757

" the largest number defined by a formula

φ    φ , such that ZFC proves  φ

φ  defines a unique number with a proof of length n"

- Now this sounds like what I was going for!

Mind if I define a number with it? Now about we set n as Googol -> Googol -> Googol -> Googolplex in Chained Arrow notation, and then iterate the function Googolplexplex times?