The Isomorphism Problem for omega-Automatic Trees

Details The Isomorphism Problem for omega-Automatic Trees The Isomorphism Problem for omega-Automatic Trees

2010-04-05

arxiv.org/abs/1004.0610v1

Computer Science

Logic in Computer Science

Scientific paper

The main result of this paper is that the isomorphism for omega-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalban, and Nies showing that the isomorphism problem for omega-automatic structures is not $\Sigma^1_2$. Moreover, assuming the continuum hypothesis CH, we can show that the isomorphism problem for omega-automatic trees of finite height is recursively equivalent with second-order arithmetic. On the way to our main results, we show lower and upper bounds for the isomorphism problem for omega-automatic trees of every finite height: (i) It is decidable ($\Pi^0_1$-complete, resp,) for height 1 (2, resp.), (ii) $\Pi^1_1$-hard and in $\Pi^1_2$ for height 3, and (iii) $\Pi^1_{n-3}$- and $\Sigma^1_{n-3}$-hard and in $\Pi^1_{2n-4}$ (assuming CH) for all n > 3. All proofs are elementary and do not rely on theorems from set theory.

Affiliated with

Also associated with

No associations

Rating

The Isomorphism Problem for omega-Automatic Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Isomorphism Problem for omega-Automatic Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Isomorphism Problem for omega-Automatic Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637257