The Isomorphism Relation Between Tree-Automatic Structures

An $ω$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $ω$-tree-automatic structures. We prove first that the isomorphism relation for $ω$-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n >1) is not determined by the axiomatic system ZFC. Then we prove that the isomorphism problem for $ω$-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n >1) is neither a $Σ_2^1$-set nor a $Π_2^1$-set.

No reviews yet.

No comments yet.