Algebraic Ordinals

作者：Bloom Stephen L^*; Esik Zoltan

来源：Fundamenta Informaticae, 2010, 99(4): 383-407.

DOI：10.3233/FI-2010-255

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 <(l). If (Fr (T) <(l)) is well-ordered, its order type is an algebraic ordinal. We prove that the algebraic ordinals are exactly the ordinals less than omega(omega omega).

• 出版日期2010