Location of Repository

By Algebraic Ordinals, S. L. Bloom and Z. Ésik

Abstract

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 ωωω.

OAI identifier: oai:CiteSeerX.psu:10.1.1.313.3555
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0907.0877... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.