代数序数
Algebraic Ordinals
摘要：
代数树T是由有限的不动点方程组确定的代数树。代数树t的边界\Fr（T）按字典序\lex线性排序。当（\Fr（T），\lex）是良序时，它的序类型是\textbf{algebraic ordinal}。证明了代数序数恰为小于$ω^{ω^ω}$的序数。
英文摘要：
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 \lex. When (\Fr(T),\lex) is well-ordered, its order type is an \textbf{algebraic ordinal}. We prove that the algebraic ordinals are exactly the ordinals less than $ω^{ω^ω}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
