Automatic Ordinals

arXiv1205.1775MaRDI QIDQ6232874FDOQ6232874

Authors: Olivier Finkel, Stevo Todorčević 

Publication date: 8 May 2012

Abstract: We prove that the injectively omega-tree-automatic ordinals are the ordinals smaller than $omeg{a}^{omeg{a}^{o}mega}$. Then we show that the injectively $omeg{a}^n$-automatic ordinals, where $n>0$ is an integer, are the ordinals smaller than $omeg{a}^{omeg{a}^n}$. This strengthens a recent result of Schlicht and Stephan who considered in [Schlicht-Stephan11] the subclasses of finite word $omeg{a}^n$-automatic ordinals. As a by-product we obtain that the hierarchy of injectively $omeg{a}^n$-automatic structures, n>0, which was considered in [Finkel-Todorcevic12], is strict.

This page was built for publication: Automatic Ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232874)