Isomorphisms of scattered automatic linear orders

Kuske, Dietrich GND

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.

Cite

Citation style:
Kuske, D., 2012. Isomorphisms of scattered automatic linear orders, in: Computer Science Logic 2012: 26th International Workshop, 21th Annual Conference of the EACSL, CSL ’12, September 3 - 6, 2012, Fontainebleau, France. pp. 455–469. https://doi.org/10.4230/LIPIcs.CSL.2012.455
Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:

Export