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

> Is it what you want? If it turns out that: PTO PA+Ind(ω) = PTO KPω = BHO PTO PA+Ind(limit of admissible) = PTO KPl = Takeuti-Feferman-Buchholz ordinal PTO PA+Ind(recursively inaccessible) = PTO KPi and Θ(PA+Ind(ω),n) ≈ fψ(ε Ω+1) (n) Θ(PA+Ind(limit of admissible),n) ≈ fψ(ε Ω ω+1 ) (n) Θ(PA+Ind(recursively inaccessible),n) ≈ fψ(ε I+1) (n) e t.c.? Will the function Θ be considered correctly defined then?