User blog comment:Dchew89/New Custom Ordinal Notation/@comment-35470197-20190223232640

In order to define an ordinal notation system, it is not sufficent to list up finitely many results and expain "fixed points are assumed to be broken using \(+1\)". You need to define a primitive recursive well-order \(<\) on a recursive subset of \(\mathbb{N}\).