2000 character limit reached
The isomorphism problem for tree-automatic ordinals with addition (1810.13153v2)
Published 31 Oct 2018 in cs.FL and math.LO
Abstract: This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the linear order relation of the ordinal and the ordinal addition operation can be determined by tree automata. We describe an algorithm that, given two tree-automatic ordinals with the ordinal addition operation, decides if the ordinals are isomorphic.