Recognition: unknown
Isomorphisms of scattered automatic linear orders
classification
💻 cs.LO
cs.FL
keywords
automaticlinearordersscatteredautomorphismsexistencewordarithmetical
read the original abstract
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic linear orders, we determine the exact level of undecidability in the arithmetical hierarchy.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.