DC FieldValueLanguage
dc.contributor.authorFinkel, Olivieren
dc.contributor.authorTodorčević, Stevoen
dc.date.accessioned2020-05-01T20:29:24Z-
dc.date.available2020-05-01T20:29:24Z-
dc.date.issued2013-04-16en
dc.identifier.issn1548-7199en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2199-
dc.description.abstractWe prove that the injectively ω-tree-automatic ordinals are the ordinals smaller than ωωω . Then we show that the injectively ωn -automatic ordinals, where n ≥ 1 is an integer, are the ordinals smaller than ωωn . This strengthens a recent result of Schlicht and Stephan who considered in [21] the subclasses of finite word ωn -automatic ordinals. As a by-product we obtain that the hierarchy of injectively ωn -automatic structures, n ≥ 1, which was considered in [9], is strict.en
dc.publisherOld City Publishing-
dc.relation.ispartofInternational Journal of Unconventional Computingen
dc.subjectω-Tree-Automatic Structures; | ω -Automatic Structures n | Ordinalsen
dc.titleAutomatic ordinalsen
dc.typeArticleen
dc.identifier.scopus2-s2.0-84876059508en
dc.relation.firstpage61en
dc.relation.lastpage70en
dc.relation.issue1-2en
dc.relation.volume9en
dc.description.rankM23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-4543-7962-
Show simple item record

SCOPUSTM   
Citations

2
checked on Jan 31, 2023

Page view(s)

21
checked on Jan 31, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.