2009/07/05 by Stephen L. Bloom, S. L. Bloom, Bloom, S. L. +3
Computer Science · #F.4.3 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Polynomial and algebraic computation #Rough Sets and Fuzzy Logic #cs.FL #cs.LO
paper · pdf · doi:10.48550/arxiv.0907.0877
30 pages
openalex publication_date 2009/07/05 · arxiv created 2010/02/08 · arxiv updated 2010/02/08 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28
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 algebraic ordinal. We prove that the algebraic ordinals are exactly the ordinals less than ωωω.