Automatic ordinals

DC Field	Value	Language
dc.contributor.author	Finkel, Olivier	en
dc.contributor.author	Todorčević, Stevo	en
dc.date.accessioned	2020-05-01T20:29:24Z	-
dc.date.available	2020-05-01T20:29:24Z	-
dc.date.issued	2013-04-16	en
dc.identifier.issn	1548-7199	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2199	-
dc.description.abstract	We 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.publisher	Old City Publishing	-
dc.relation.ispartof	International Journal of Unconventional Computing	en
dc.subject	ω-Tree-Automatic Structures; \| ω -Automatic Structures n \| Ordinals	en
dc.title	Automatic ordinals	en
dc.type	Article	en
dc.identifier.scopus	2-s2.0-84876059508	en
dc.relation.firstpage	61	en
dc.relation.lastpage	70	en
dc.relation.issue	1-2	en
dc.relation.volume	9	en
dc.description.rank	M23	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-
crisitem.author.orcid	0000-0003-4543-7962	-

2

checked on Nov 24, 2024

39

checked on Nov 24, 2024

Check