User blog comment:Flitri/An ordinal Collapsing up to the Least weakly Mahlo Cardinal/@comment-35470197-20190409053305/@comment-25216794-20190411060923

I looked up primitive recursive well-ordering and maybe I’m wrong but it seems like proving that a function is a primitive recursive well-ordering means two things:

1. Being able to rewrite it to use call itself and other primitive recursive functions. 2. Prove that every nonempty set of ordinal written in this notation has a least element.

I think I can do both and I’ll write a possible proof soon, but is this in the correct direction?