Abstract
Recently, Schlicht and Stephan lifted the notion of automatic-structures to the notion of (finite-word) ordinal-automatic structures. These are structures whose domain and relations can be represented by automata reading finite words whose shape is some fixed ordinal . We lift Delhommé's relative-growth-technique from the automatic and tree-automatic setting to the ordinal-automatic setting. This result implies that the random graph is not ordinal-automatic and infinite integral domains are not ordinal-automatic with respect to ordinals below where is the first uncountable ordinal.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.