The complexity of isomorphism problem for computable projective planes

Computable presentations for projective planes are studied. We prove that the isomorphism problem is $\Sigma^1_1$ complete for the following classes of projective planes: pappian projective planes, desarguesian projective planes, arbitrary projective planes.