An algebraic tree t is one determined by a finite system of fixed point equations. The frontier Fr(t) of an algebraic tree t is linearly ordered by the lexicographic order <ℓ. When (Fr(t),<ℓ) is well-ordered, its order type is an algebraic ordinal. We prove that the algebraic ordinals are exactly the ordinals less than ωωω.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.