User blog comment:Scorcher007/S - Large Countable Ordinal Notation. Chapter I, Up to KPm./@comment-31580368-20190912145823/@comment-31580368-20190914112208

Well, is there any way to define a theory like KP based on its L_x model so that it can be used in (halting times of Turing machines)-functions? As you understand, I am not very versed in model theory and am only familiar with it superficially. I want to understand if there is a way to use large countable ordinals in countable googology without OCF.

Essentially in this hierarchy, I analyzed how large countable ordinals (bye until up to Mahlo) would behave in potentially created OCF. For comparison, I used DAN. Expression written in DAN should be the limit for any systems of fundamental sequences associated with OCF based on ordinal x.