User blog comment:Ubersketch/A proposal for a standard/@comment-11227630-20190813030043/@comment-35470197-20190813032858

You seem to forget the problem that simplification without weaking can cause the difficulty to determin standard forms and ∈-relation in a recursive way. Or do you have explicit algorithms (completely described in arithmetic)? For example, the assumption α∈C(α,ρ) is very important, because it is usually heavily used to give both algorithms. If you have explicit algorithms for the notation associated to the simplified OCF, please tell me.