The Isomorphism Problem on Classes of Automatic Structures

Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii) The isomorphism problem for automatic trees of height n 2 is 0 2n-3-complete. (iii) The isomorphism problem for automatic linear orders is not arithmetical.

• Type: Journal
• Year: 2010
• Where: LICS
• Authors: Dietrich Kuske, Jiamou Liu, Markus Lohrey
• Keywords: Automated Reasoning, Automatic Equivalence Relations, Automatic Linear Orders, Isomorphism Problem, LICS 2010